Counting independent sets in cubic graphs of given girth (Q1791708)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting independent sets in cubic graphs of given girth |
scientific article; zbMATH DE number 6951586
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting independent sets in cubic graphs of given girth |
scientific article; zbMATH DE number 6951586 |
Statements
Counting independent sets in cubic graphs of given girth (English)
0 references
11 October 2018
0 references
independent sets
0 references
independence polynomial
0 references
hard-core model
0 references
Petersen graph
0 references
Heawood graph
0 references
occupancy fraction
0 references
0 references
0.8078330755233765
0 references
0.8037452697753906
0 references
0.8012309074401855
0 references
0.7953118085861206
0 references
0.7918699979782104
0 references
