Bounds on the number of vertex independent sets in a graph (Q2372400): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q870973 |
||
| Property / author | |||
| Property / author: Preben Dahl Vestergaard / rank | |||
Revision as of 08:30, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the number of vertex independent sets in a graph |
scientific article |
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
