𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the least eigenvalue of cacti

✍ Scribed by Miroslav Petrović; Tatjana Aleksić; Višnja Simić

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
274 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

The least eigenvalue of the complements
The least eigenvalue of the complements of trees
✍ Yi-Zheng Fan; Fei-Fei Zhang; Yi Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Let T c n be the set of the complements of trees of order n. In this paper, we characterize the unique graph whose least eigenvalue attains the minimum among all graphs in T c n .

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