A characterization of connected \((1,2)\)-domination graphs of tournaments (Q647233)
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: A characterization of connected (1,2)-domination graphs of tournaments |
scientific article; zbMATH DE number 5984191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of connected \((1,2)\)-domination graphs of tournaments |
scientific article; zbMATH DE number 5984191 |
Statements
A characterization of connected \((1,2)\)-domination graphs of tournaments (English)
0 references
1 December 2011
0 references
tournament
0 references
\((1,2)\)-dominating pair
0 references
\((1,2)\)-domination graph
0 references
0.9139194488525392
0 references
