Some upper bounds for 2-domination number of graphs and a Graffiti.pc conjecture (Q3380752)
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: Some upper bounds for 2-domination number of graphs and a Graffiti.pc conjecture |
scientific article; zbMATH DE number 7403632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some upper bounds for 2-domination number of graphs and a Graffiti.pc conjecture |
scientific article; zbMATH DE number 7403632 |
Statements
29 September 2021
0 references
2-domination number
0 references
triangle-free graphs
0 references
split graphs
0 references
hypergraphs
0 references
0.8265367150306702
0 references
0.8140778541564941
0 references
0.8117738366127014
0 references
0.7869749069213867
0 references
