✦ LIBER ✦

Spectral bounds for the betweenness of a graph

✍ Scribed by F. Comellas; S. Gago

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 127 KB
Volume: 423
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.08.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bound on the spectral radius of graphs

✍ Hong Yuan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 238 KB

A new upper bound for the Laplacian spec

A new upper bound for the Laplacian spectral radius of graphs

✍ Ji-Ming Guo 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Spectral bounds for the clique and indep

Spectral bounds for the clique and independence numbers of graphs

✍ Herbert S Wilf 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Bounds for the covering number of a grap

Bounds for the covering number of a graph

✍ H.L. Abbott; A.C. Liu 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 333 KB

A spectral lower bound for the treewidth

A spectral lower bound for the treewidth of a graph and its consequences

✍ L.Sunil Chandran; C.R. Subramanian 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 95 KB

We give a lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. We use this lower bound to show that the treewidth of a d-dimensional hypercube is at least 3 We generalize this result to Hamming graphs. We also observe that every graph G on n v

A Sharp Upper Bound of the Spectral Radi

A Sharp Upper Bound of the Spectral Radius of Graphs

✍ Yuan Hong; Jin-Long Shu; Kunfu Fang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB