Title of article
Bipartite density of cubic graphs
Author/Authors
Abraham Berman، نويسنده , , Xiaodong Zhang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
9
From page
27
To page
35
Abstract
We first obtain the exact value for bipartite density of a cubic line graph on n vertices. Then we give an upper bound for the bipartite density of cubic graphs in terms of the smallest eigenvalue of the adjacency matrix. In addition, we characterize, except in the case n=20, those graphs for which the upper bound is obtained.
Keywords
Bipartite density of graph , Eigenvalue , Line graph , Cubic graph
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949431
Link To Document