Article ID Journal Published Year Pages File Type
9516213 Journal of Combinatorial Theory, Series B 2005 11 Pages PDF
Abstract
For bipartite graphs with minimal degree at least two, we prove that ρ(G̃)⩾dL−1+dR−1, where dL, dR are the average degrees on the left and right hand sides.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A lower bound on the spectral radius of the universal cover of a graph
Authors
,