Bounds on the number of vertex independent sets in a graph (Q2372400): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.11650/twjm/1500404576 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4250685846 / rank | |||
Normal rank | |||
Latest revision as of 20:13, 19 March 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
