Partitioning a graph into a dominating set, a total dominating set, and something else (Q2997583)
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: Partitioning a graph into a dominating set, a total dominating set, and something else |
scientific article; zbMATH DE number 5885803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a graph into a dominating set, a total dominating set, and something else |
scientific article; zbMATH DE number 5885803 |
Statements
Partitioning a graph into a dominating set, a total dominating set, and something else (English)
0 references
9 May 2011
0 references
domination
0 references
total domination
0 references
domatic number
0 references
vertex partition, Petersen graph
0 references
0.9466767
0 references
0.94586575
0 references
0 references
0.91240025
0 references
0.91231924
0 references
0 references
0.90912485
0 references
