Abstract
Let U(n, g) and B(n, g) be the set of unicyclic graphs and bicyclic graphs on n vertices with girth g, respectively. Let B1(n, g) be the subclass of B(n, g) consisting of all bicyclic graphs with two edge-disjoint cycles and B2 (n, g) = B(n, g)\B1 (n, g). This paper determines the unique graph with the maximal signless Laplacian spectral radius among all graphs in U(n, g) and B(n, g), respectively. Furthermore, an upper bound of the signless Laplacian spectral radius and the extremal graph for B(n, g) are also given.
| Original language | English |
|---|---|
| Pages (from-to) | 1-10 |
| Number of pages | 10 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 18 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2011 |
Keywords
- Bicyclic graphs
- Girth
- Signless laplacian spectral radius
- Unicyclic graphs
Fingerprint
Dive into the research topics of 'The signless Laplacian spectral radius of unicyclic and bicyclic graphs with a given girth'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver