𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximizing the spectral radius of bicyclic graphs with fixed girth

✍ Scribed by Mingqing Zhai; Yarong Wu; Jinlong Shu

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
248 KB
Volume
431
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

Let B(n, g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we determine the unique graph with the maximal spectral radius among all graphs in B(n, g). Moreover, the maximal spectral radius is a decreasing function on g.

πŸ“œ SIMILAR VOLUMES

The Laplacian spectral radius of bicycli
The Laplacian spectral radius of bicyclic graphs with a given girth
✍ Mingqing Zhai; Guanglong Yu; Jinlong Shu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 622 KB

Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. Let B 1 (n, g) be the subclass of B(n, g) consisting of all bicyclic graphs with two edge-disjoint cycles and B 2 (n, g) = B(n, g) \ B 1 (n, g). This paper determines the unique graph with the maximal Laplacian spectral radius a

The spectral radius of bicyclic graphs w
The spectral radius of bicyclic graphs with prescribed degree sequences
✍ Yingluan Liu; Bolian Liu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 252 KB

Restricted to the bicyclic graphs with prescribed degree sequences, we determine the (unique) graph with the largest spectral radius with respect to the adjacency matrix.

On ordering bicyclic graphs with respect
On ordering bicyclic graphs with respect to the Laplacian spectral radius
✍ Shuchao Li; Slobodan K. SimiΔ‡; Dejan V. ToΕ‘iΔ‡; Qin Zhao πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 303 KB

A connected graph of order n is bicyclic if it has n + 1 edges. He et al. [C.X. He, J.Y. Shao, J.L. He, On the Laplacian spectral radii of bicyclic graphs, Discrete Math. 308 (2008) 5981-5995] determined, among the n-vertex bicyclic graphs, the first four largest Laplacian spectral radii together wi