On the number of independent and \(k\)-dominating sets in graphs with average vertex degree at most \(k\) (Q6492379)
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 7837999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of independent and \(k\)-dominating sets in graphs with average vertex degree at most \(k\) |
scientific article; zbMATH DE number 7837999 |
Statements
On the number of independent and \(k\)-dominating sets in graphs with average vertex degree at most \(k\) (English)
0 references
25 April 2024
0 references
independent set
0 references
dominating set
0 references
\(k\)-dominating set
0 references
enumerative combinatorics
0 references
0.8279633522033691
0 references
0.8193285465240479
0 references
0.8113176226615906
0 references
0.8038341403007507
0 references
0.8036208152770996
0 references
