✦ LIBER ✦

On the sum-connectivity index of cacti

✍ Scribed by Feiying Ma; Hanyuan Deng

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 293 KB
Volume: 54
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.02.040

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 α

On connected sums of manifolds

✍ Sylvain E. Cappell 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 413 KB

On the least eigenvalue of cacti

✍ Miroslav Petrović; Tatjana Aleksić; Višnja Simić 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Among the cacti with n vertices and k cycles we determine a unique cactus whose least eigenvalue is minimal. We also explore cacti with n vertices and among them, we find a unique cactus whose least eigenvalue is minimal.

On the connectivity of graphs generated

On the connectivity of graphs generated by a sum of random mappings

✍ Jerzy Jaworski; Michał Karoński 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 537 KB

## Abstract We consider four models of random directed multigraphs with __n__ labeled vertices of out‐degree __d__. First we establish formal relationships between our models with respect to exact and asymptotic (as __n__ → ∞) probabilities of possessing a graph monotone property. We also study the

On the Hamiltonicity exponent of directe

On the Hamiltonicity exponent of directed cacti

✍ Günter Schaar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 532 KB

For a digraph G, the kth power G k can be defined in a similar way as in the case of undirected graphs. If G is finite and strongly connected, en(G) := min{k : G k is Hamiltonian} is called the Hamiltonicity exponent of G; analogously, further exponents--for instance, the Hamiltonian connectedness e

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views