✦ LIBER ✦

On the spectral radius of bicyclic graphs with n vertices and diameter d

✍ Scribed by Shu-Guang Guo

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 211 KB
Volume: 422
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.09.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The spectral radius of unicyclic and bic

The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices

✍ Shu-Guang Guo 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The spectral radius of tricyclic graphs

The spectral radius of tricyclic graphs with n vertices and k pendent vertices

✍ Xianya Geng; Shuchao Li 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 185 KB

On the Spectral Radius of Graphs with Cu

On the Spectral Radius of Graphs with Cut Vertices

✍ Abraham Berman; Xiao-Dong Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 136 KB

The Laplacian spectral radius of tricycl

The Laplacian spectral radius of tricyclic graphs with vertices and pendant vertices

✍ Shu-Guang Guo; Yan-Feng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The minimal spectral radius of graphs of

The minimal spectral radius of graphs of order n with diameter

✍ Xi-Ying Yuan; Jia-Yu Shao; Yue Liu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 195 KB

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