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,
β¦ LIBER β¦
The number of independent sets of tricyclic graphs
β Scribed by Zhongxun Zhu; Qigang Yu
- Book ID
- 116217496
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 475 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The number of maximal independent sets i
β
ZoltΓ‘n FΓΌredi
π
Article
π
1987
π
John Wiley and Sons
π
English
β 286 KB
π 2 views
The number of independent sets of unicyc
β
Gong Chen; Zhongxun Zhu
π
Article
π
2012
π
Elsevier Science
π
English
β 389 KB
Upper bound for the number of independen
β
A. A. Sapozhenko
π
Article
π
2007
π
SP MAIK Nauka/Interperiodica
π
English
β 175 KB
Constraints on the number of maximal ind
β
Jiuqiang Liu
π
Article
π
1994
π
John Wiley and Sons
π
English
β 387 KB
π 2 views
## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. ErdΓΆs, that the maximum number of m
On the number of independent sets in dam
β
Omelyanov, K. G.
π
Article
π
2005
π
Walter de Gruyter GmbH & Co. KG
π
English
β 58 KB
Bipartite graphs can have any number of
β
V. Linek
π
Article
π
1989
π
Elsevier Science
π
English
β 476 KB
In this paper we prove that for every positive integer n there exists a bipartite graph with exactly n independent sets.