𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The spectral radius of bicyclic graphs with prescribed degree sequences

✍ Scribed by Yingluan Liu; Bolian Liu


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
252 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Maximizing the spectral radius of bicycl
✍ Mingqing Zhai; Yarong Wu; Jinlong Shu πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 248 KB

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.

The Laplacian spectral radius of bicycli
✍ 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

On ordering bicyclic graphs with respect
✍ 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

The orders of graphs with prescribed deg
✍ Timothy A. Sipka πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 321 KB πŸ‘ 1 views

## Abstract The degree set π’Ÿ^G^ of a graph __G__ is the set of degrees of the vertices of __G.__ For a finite nonempty set __S__ of positive integers, all positive integers __p__ are determined for which there exists a graph __G__ of order __p__ such that π’Ÿ^G^ = __S__.