The signless Laplacian spectral radius of unicyclic and bicyclic graphs with a given girth

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Li, K., Wang, L., & Zhao, G. (2011). The signless Laplacian spectral radius of unicyclic and bicyclic graphs with a given girth. Electronic Journal of Combinatorics, 18(1), 1–10. https://doi.org/10.37236/670

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free