Bipartite density of cubic graphs: the case of equality
暂无分享,去创建一个
Recently, Berman and Zhang (Discrete Math. 260 (2003) 27) obtained an upper bound for the bipartite density of cubic graphs in terms of the smallest eigenvalue of an adjacency matrix and attempted to characterize graphs for which the upper bound is attained. Here we do characterize graphs for which the upper bound is attained, and correct a few errors from Berman and Zhang's paper.
[1] J. Seidel,et al. Line graphs, root systems, and elliptic geometry , 1976 .
[2] Dragoš Cvetković,et al. Graphs related to exceptional root systems , 1976 .
[3] Xiao-Dong Zhang,et al. Bipartite density of cubic graphs , 2003, Discret. Math..
[4] J. Seidel,et al. Line graphs, root systems, and elliptic geometry , 1976 .
[5] Dragoš Cvetković,et al. Spectral Generalizations of Line Graphs: On Graphs with Least Eigenvalue -2 , 2004 .