✦ LIBER ✦

On the connectivity index of trees

✍ Scribed by Yue Jiang; Mei Lu

Publisher: Springer
Year: 2007
Tongue: English
Weight: 250 KB
Volume: 43
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-007-9281-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the general sum-connectivity index of

On the general sum-connectivity index of trees

✍ Zhibin Du; Bo Zhou; Nenad Trinajstić 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 226 KB

The general sum-connectivity index of a graph G is defined as , where d u denotes the degree of vertex u in G, E(G) denotes the edge set of G, and α is a real number. We determine the maximum value for the general sum-connectivity indices of n-vertex trees and the corresponding extremal trees for α

Sum-connectivity index of molecular tree

Sum-connectivity index of molecular trees

✍ Rundan Xing; Bo Zhou; Nenad Trinajstić 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 181 KB

Tight bounds on the algebraic connectivi

Tight bounds on the algebraic connectivity of Bethe trees

✍ Oscar Rojo; Luis Medina 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Optimal on-line decremental connectivity

Optimal on-line decremental connectivity in trees

✍ Stephen Alstrup; Jens Peter Secher; Maz Spork 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Let T be a tree with n nodes from which edges are deleted interspersed with m on-line connectivity queries. Even and Shiloach gave an 0( n log n + m) algorithm to process edge deletion and m queries (Even and Shiloach, 1981). In this paper we present an O(n + m) algorithm for the same problem. @ 199

On the sum-connectivity index of cacti

✍ Feiying Ma; Hanyuan Deng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 293 KB

On connectivities of tree graphs

✍ Guizhen Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

Let T(G) be the tree graph of a graph G with cycle rank r. Then K ( T ( G ) ) 3 m ( G ) -r, where K(T(G)) and m(G) denote the connectivity of T ( G ) and the length of a minimum cycle basis for G, respectively. Moreover, the lower bound of m ( G ) -r is best possible.