๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Number of Independent Sets in a Graph with Small Maximum Degree

โœ Scribed by David Galvin; Yufei Zhao

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
180 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The maximum number of edges in a graph w
The maximum number of edges in a graph with fixed edge-degree
โœ R.J. Faudree; J. Sheehan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.

The irredundance number and maximum degr
The irredundance number and maximum degree of a graph
โœ B. Bollobรกs; E.J. Cockayne ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

The number of maximal independent sets i
The number of maximal independent sets in a connected graph
โœ Jerrold R. Griggs; Charles M. Grinstead; David R. Guichard ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1021 KB

We determine the maximum on n vertices can have, and we a question of Wilf. number of maximal independent sets which a connected graph completely characterize the extremal graphs, thereby answering \* Partially supported by NSF grant number DIMS-8401281. t Partially supported by NSF grant number D S

The structure and maximum number of maxi
The structure and maximum number of maximum independent sets in trees
โœ Jennifer Zito ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 732 KB

A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n