|
|||||
|
|
Bipartite density of cubic graphs |
|
| Authors: | Abraham Berman Xiao-Dong Zhang |
| Affiliation: | Department of Mathematics, Technion, Israel Institute of Technology, Haifa 32000, Israel |
| 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 Cubic graph Eigenvalue Line graph |
| 本文献已被 ScienceDirect 等数据库收录！ | |