The Laplacian spectral radius of some graphs
โ Scribed by Jianxi Li; Wai Chee Shiu; Wai Hong Chan
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 178 KB
- Volume
- 431
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let G be an n-vertex (n 3) simple graph embeddable on a surface of Euler genus ฮณ (the number of crosscaps plus twice the number of handles). Denote by the maximum degree of G. In this paper, we first present two upper bounds on the Laplacian spectral radius of G as follows: (i) (ii) If G is 4-conn
By the signless Laplacian of a (simple) graph G we mean the matrix , where A(G), D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. It is known that connected graphs G that maximize the signless Laplacian spectral radius ฯ(Q (G)) over all connected graphs
In this paper, we investigate how the Laplacian spectral radius changes when one graph is transferred to another graph obtained from the original graph by adding some edges, or subdivision, or removing some edges from one vertex to another.
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