𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The signless Laplacian spectral radius of graphs on surfaces

✍ Scribed by Feng, Lihua; Yu, Guihai; Ilić, Aleksandar; Stevanović, Dragan

Book ID
118163175
Publisher
Taylor and Francis Group
Year
2013
Tongue
English
Weight
125 KB
Volume
61
Category
Article
ISSN
0308-1087

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with maximal signless Laplacian s
Graphs with maximal signless Laplacian spectral radius
✍ Ting-Jung Chang; Bit-Shun Tam 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 340 KB

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

On the signless Laplacian spectral radiu
On the signless Laplacian spectral radius of graphs with cut vertices
✍ Bao-Xuan Zhu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 129 KB

In this paper, we show that among all the connected graphs with n vertices and k cut vertices, the maximal signless Laplacian spectral radius is attained uniquely at the graph G n,k , where G n,k is obtained from the complete graph K n-k by attaching paths of almost equal lengths to all vertices of

The Laplacian spectral radius of graphs
The Laplacian spectral radius of graphs on surfaces
✍ Liang Lin 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 89 KB

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

The minimum signless Laplacian spectral
The minimum signless Laplacian spectral radius of graphs with given independence number
✍ Ruilin Li; Jinsong Shi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 307 KB

The independence number α(G) of G is defined as the maximum cardinality of a set of pairwise non-adjacent vertices which is called an independent set. In this paper, we characterize the graphs which have the minimum spectral radius among all the connected graphs of order n with independence number α