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

On the spectral radius of graphs with cut edges

โœ Scribed by Huiqing Liu; Mei Lu; Feng Tian

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
184 KB
Volume
389
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On the spectral radius of graphs
On the spectral radius of graphs
โœ Aimei Yu; Mei Lu; Feng Tian ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB
The spectral radius of submatrices of La
The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
โœ Jason J. Molitierno ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 326 KB

In [J. Molitierno, The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector, Linear Algebra Appl. 406 (2005) 253-271], we observed the effects on the spectral radius of submatrices of the Laplacian matrix L for a tree by deleting a row and column of

The Spectral Radius of Graphs on Surface
The Spectral Radius of Graphs on Surfaces
โœ M.N. Ellingham; Xiaoya Zha ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 152 KB

This paper provides new upper bounds on the spectral radius \ (largest eigenvalue of the adjacency matrix) of graphs embeddable on a given compact surface. Our method is to bound the maximum rowsum in a polynomial of the adjacency matrix, using simple consequences of Euler's formula. Let # denote th