๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The least eigenvalue of a graph with cut vertices

โœ Scribed by Yi Wang; Yi-Zheng Fan

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
175 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Bounds on the eigenvalues of graphs with
Bounds on the eigenvalues of graphs with cut vertices or edges
โœ Bao-Xuan Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 325 KB

In this paper, we characterize the extremal graph having the maximal Laplacian spectral radius among the connected bipartite graphs with n vertices and k cut vertices, and describe the extremal graph having the minimal least eigenvalue of the adjacency matrices of all the connected graphs with n ver

The number of cut-vertices in a graph of
The number of cut-vertices in a graph of given minimum degree
โœ Michael O. Albertson; David M. Berman ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in