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

On graphs with cut vertices and cut edges

โœ Scribed by Fang, Kun Fu; Shu, Jin Long

Book ID
121560625
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2014
Tongue
English
Weight
188 KB
Volume
30
Category
Article
ISSN
1439-7617

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

On the signless Laplacian spectral radiu
On the signless Laplacian spectral radius of graphs with cut vertices
โœ Bao-Xuan Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 129 KB

In this paper, we show that among all the connected graphs with n vertices and k cut vertices, the maximal signless Laplacian spectral radius is attained uniquely at the graph G n,k , where G n,k is obtained from the complete graph K n-k by attaching paths of almost equal lengths to all vertices of