Bounds on the number of vertex independent sets in a graph (Q2372400)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5174899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on the number of vertex independent sets in a graph |
scientific article; zbMATH DE number 5174899 |
Statements
Bounds on the number of vertex independent sets in a graph (English)
0 references
26 July 2007
0 references
The authors prove best-possible upper and lower bounds for the number of all independent sets in general and regular graphs, forests without isolated vertices, bipartite graphs, unicyclic graphs and claw-free graphs. In several cases paths turn out to be the extremal structure and hence the Fibonacci numbers count the independent sets.
0 references
independent set
0 references
Fibonacci numbers
0 references
Merrifield-Simmons
0 references
Hosoya
0 references
claw-free
0 references
unicyclic
0 references
0.8224230408668518
0 references
0.8147727251052856
0 references
0.8137707710266113
0 references
