๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Signless Laplacian spectral radius and Hamiltonicity

โœ Scribed by Bo Zhou

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
112 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

We give tight conditions on the signless Laplacian spectral radius of a graph for the existence of Hamiltonian paths and cycles.

๐Ÿ“œ 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 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 ฮฑ

Spectral radius and Hamiltonicity of gra
Spectral radius and Hamiltonicity of graphs
โœ Miroslav Fiedler; Vladimir Nikiforov ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 91 KB

Let G be a graph of order n and ฮผ(G) be the largest eigenvalue of its adjacency matrix. Let G be the complement of G. Write K n-1 + v for the complete graph on n -1 vertices together with an isolated vertex, and K n-1 + e for the complete graph on n -1 vertices with a pendent edge. We show that: