𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Trees with Given Stability Number and Minimum Number of Stable Sets

✍ Scribed by Véronique Bruyère; Gwenaël Joret; Hadrien Mélot

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
445 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Trees with the minimum Wiener number
Trees with the minimum Wiener number
✍ Shu-Chung Liu; Li-Da Tong; Yeong-Nan Yeh 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB

The Wiener number (W) of a connected graph is the sum of distances for all pairs of vertices. As a graphical invariant, it has been found extensive application in chemistry. Considering the family of trees with n vertices and a fixed maximum vertex degree, we derive some methods that can strictly re

Two-cacti with minimum number of spannin
Two-cacti with minimum number of spanning trees
✍ Preben Dahl Vestergaard 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 624 KB

proved that the spanning trees of a 2-cactus partition into at least 3 isomorphism classes. Here we examine the structure of these 2-cacti for which the spanning trees partition into exactly 3 isomorphism classes.

A sharp upper bound for the number of st
A sharp upper bound for the number of stable sets in graphs with given number of cut edges
✍ Hongbo Hua 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.