Title of article
Bipartite density of cubic graphs: the case of equality
Author/Authors
Dragan Stevanovic، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
3
From page
279
To page
281
Abstract
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.
Keywords
Bipartite density of graph , Cubic graph , Line graph , Eigenvalue , Generalized line graph , Exceptional graph
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948944
Link To Document