A general method in the theory of domination in graphs (Q3066944)
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 general method in the theory of domination in graphs |
scientific article; zbMATH DE number 5839326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general method in the theory of domination in graphs |
scientific article; zbMATH DE number 5839326 |
Statements
A general method in the theory of domination in graphs (English)
0 references
20 January 2011
0 references
tree
0 references
domination
0 references
irredundance
0 references
distance domination
0 references
connected domination
0 references
total domination
0 references
distance irredundance
0 references
\(p\)-domination
0 references
end domination
0 references
weakly connected domination
0 references
paired domination
0 references
double domination
0 references
\(p\)-tuple domination
0 references
restrained domination
0 references
weak domination
0 references
0.94027144
0 references
0 references
0 references
0.9232132
0 references
0 references
