✦ LIBER ✦

The spectral radius of trees on k pendant vertices

✍ Scribed by Baofeng Wu; Enli Xiao; Yuan Hong

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 221 KB
Volume: 395
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.08.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The signless Laplacian spectral radius o

The signless Laplacian spectral radius of tricyclic graphs and trees with k pendant vertices

✍ Ke Li; Ligong Wang; Guopeng Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 610 KB

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 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 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

On the Laplacian spectral radius of a tr

On the Laplacian spectral radius of a tree

✍ Ji-Ming Guo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Let G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. In this paper, we present a sharp upper bound for the Laplacian spectral radius of a tree in terms of the matching number and number of vertices, and deduce from that the l