✦ LIBER ✦

Maximum Randić index on Trees withk-pendant Vertices

✍ Scribed by Lian-Zhu Zhang; Mei Lu; Feng Tian

Publisher: Springer
Year: 2006
Tongue: English
Weight: 161 KB
Volume: 41
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-006-9066-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Randić Index of Quasi-tree Graphs

✍ Mei Lu; Jinwu Gao 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 674 KB

On Unicycle Graphs with Maximum and Mini

On Unicycle Graphs with Maximum and Minimum Zeroth-order Genenal Randić Index

✍ Hongbo Hua; Hanyuan Deng 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 126 KB

The spectral radius of trees on k pendan

The spectral radius of trees on k pendant vertices

✍ Baofeng Wu; Enli Xiao; Yuan Hong 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 221 KB

On numbers of vertices of maximum degree

On numbers of vertices of maximum degree in the spanning trees of a graph

✍ Jerzy Topp; Preben D. Vestergaard 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it