✦ LIBER ✦

Upper bound for the number of independent sets in graphs

✍ Scribed by A. A. Sapozhenko

Book ID: 111454379
Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 175 KB
Volume: 75
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s1064562407030301

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds for the 2-hued chromatic nu

Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number

✍ A. Dehghan; A. Ahadi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 203 KB

A new upper bound for the independence n

A new upper bound for the independence number of edge chromatic critical graphs

✍ Rong Luo; Yue Zhao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 2 views

In 1968, Vizing conjectured that if G is a -critical graph with n vertices, then (G) ≤ n / 2, where (G) is the independence number of G. In this paper, we apply Vizing and Vizing-like adjacency lemmas to this problem and prove that (G)<(((5 -6)n) / (8 -6))<5n / 8 if ≥ 6. ᭧ 2010 Wiley

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.

An Upper Bound for the Independent Domin

An Upper Bound for the Independent Domination Number

✍ Liang Sun; Jianfang Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Let G be a simple graph of order n and minimum degree $. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper, we show that i(G) n+2$&2 -n$. Thus a conjecture of Favaron is settled in the affirmative.

The number of independent sets of tricyc

The number of independent sets of tricyclic graphs

✍ Zhongxun Zhu; Qigang Yu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 475 KB

The number of maximal independent sets i

The number of maximal independent sets in connected graphs

✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,