𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On numbers of vertices of maximum degree
✍ 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