✦ 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
DOI: 10.1007/s00373-011-1060-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The least eigenvalue of a graph with cut

The least eigenvalue of a graph with cut vertices

✍ Yi Wang; Yi-Zheng Fan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 175 KB

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

Signed graphs with least eigenvalue <−2

✍ N.M. Singhi; G.R. Vijayakumar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 142 KB

The least eigenvalue of graphs with give

The least eigenvalue of graphs with given connectivity

✍ Miao-Lin Ye; Yi-Zheng Fan; Dong Liang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 131 KB

Graphs with eigenvalues at least −2

✍ Vijaya Kumar; S.B. Rao; N.M. Singhi 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 776 KB

On the spectral radius of graphs with cu

On the spectral radius of graphs with cut edges

✍ Huiqing Liu; Mei Lu; Feng Tian 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 184 KB