The covering chain of a graph (Q2811822)
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: The covering chain of a graph |
scientific article; zbMATH DE number 6592407
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The covering chain of a graph |
scientific article; zbMATH DE number 6592407 |
Statements
10 June 2016
0 references
domination
0 references
independence
0 references
irredundance
0 references
vertex covering
0 references
enclaveless set
0 references
co-irredundance
0 references
0 references
0 references
0 references
The covering chain of a graph (English)
0 references
The domination chain is a fundamental result in domination theory. In this paper, a related covering chain is introduced and studied. Using some previously known and a couple of new Gallai-type theorems, it is proved that the covering chain is the dual of the domination chain. Covering sequences in which the first parameter equals 3 are also characterized.
0 references
