On bipartite distance-regular graphs with a strongly closed subgraph of diameter three
暂无分享,去创建一个
Let @C denote a distance-regular graph with a strongly closed regular subgraph Y. Hosoya and Suzuki [R. Hosoya, H. Suzuki, Tight distance-regular graphs with respect to subsets, European J. Combin. 28 (2007) 61-74] showed an inequality for the second largest and least eigenvalues of @C in the case Y is of diameter 2. In this paper, we study the case when @C is bipartite and Y is of diameter 3, and obtain an inequality for the second largest eigenvalue of @C. Moreover, we characterize the distance-regular graphs with a completely regular strongly closed subgraph H(3,2).
[1] A. Hora,et al. Distance-Regular Graphs , 2007 .
[2] Hiroshi Suzuki. On strongly closed subgraphs with diameter two and the Q-polynomial property , 2007, Eur. J. Comb..
[3] Hiroshi Suzuki,et al. Tight distance-regular graphs with respect to subsets , 2007, Eur. J. Comb..
[4] Hiroshi Suzuki,et al. The Terwilliger Algebra Associated with a Set of Vertices in a Distance-Regular Graph , 2005 .
[5] E. Bannai,et al. Algebraic Combinatorics I: Association Schemes , 1984 .