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
โฆ LIBER โฆ
On the spectral spread of bicyclic graphs with given girth
โ Scribed by Wang, Bing; Zhai, Ming-qing; Shu, Jin-long
- Book ID
- 121603398
- Publisher
- Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2013
- Tongue
- English
- Weight
- 282 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0168-9673
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The Laplacian spectral radius of bicycli
โ
Mingqing Zhai; Guanglong Yu; Jinlong Shu
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 622 KB
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.
On the order of graphs with a given girt
โ
Balbuena, C.; Salas, J.
๐
Article
๐
2014
๐
Elsevier Science
๐
English
โ 403 KB
The Size of Bipartite Graphs with a Give
โ
Shlomo Hoory
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 90 KB
Sparse sets in the complements of graphs
โ
A.V. Kostochka; D.R. Woodall
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 145 KB
The tree number of a graph with a given
โ
M. Truszczyลski
๐
Article
๐
1988
๐
Springer Netherlands
๐
English
โ 796 KB