Full domination in graphs (Q2773042)
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: Full domination in graphs |
scientific article; zbMATH DE number 1709169
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Full domination in graphs |
scientific article; zbMATH DE number 1709169 |
Statements
Full domination in graphs (English)
0 references
24 March 2002
0 references
full domination number
0 references
full star domination number
0 references
full closed domination number
0 references
full open domination number
0 references
The full domination number of a graph \(G\) is defined as the minimum number of vertices of a full dominating set in \(G\). But a full dominating set in \(G\) is defined not quite clearly. It is only evident that this graph invariant is defined using the domination of a subgraph of \(G\) by a vertex of \(G\). According to the choice of a type of such a subgraph, various types of full dominating sets and full domination numbers are studied. This paper studies the full star domination number, the full closed domination number, and the full open domination number.
0 references
