✦ LIBER ✦

Spectral radius and Hamiltonian graphs

✍ Scribed by Mei Lu; Huiqing LIU; Feng TIAN

Book ID: 113772401
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 218 KB
Volume: 437
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.05.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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:

Walks and the spectral radius of graphs

✍ Vladimir Nikiforov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Unicyclic graphs of minimal spectral rad

Unicyclic graphs of minimal spectral radius

✍ Ling Sheng Shi 📂 Article 📅 2013 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 179 KB

Spectral characterizations of graphs wit

Spectral characterizations of graphs with small spectral radius

✍ JianFeng Wang; F. Belardo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 313 KB

On the spectral radius of graphs

✍ Aimei Yu; Mei Lu; Feng Tian 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 KB

The spectral radius of irregular graphs

✍ Lingsheng Shi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Let λ 1 be the largest eigenvalue and λ n the least eigenvalue of the adjacency matrix of a connected graph G of order n. We prove that if G is irregular with diameter D, maximum degree Δ, minimum degree δ and average degree d, then . The inequality improves previous bounds of various authors and