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

The Least Eigenvalue of Graphs with Cut Edges

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


Book ID
113036257
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
160 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Bounds on the eigenvalues of graphs with
โœ 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

Graphs with eigenvalues at least โˆ’2
โœ Vijaya Kumar; S.B. Rao; N.M. Singhi ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 776 KB