Acyclic domination (Q1579559): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Sandra M. Hedetniemi / rank
Normal rank
 
Property / author
 
Property / author: Stephen T. Hedetniemi / rank
Normal rank
 
Property / author
 
Property / author: Douglas F. Rall / rank
Normal rank
 
Property / author
 
Property / author: Sandra M. Hedetniemi / rank
 
Normal rank
Property / author
 
Property / author: Stephen T. Hedetniemi / rank
 
Normal rank
Property / author
 
Property / author: Douglas F. Rall / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00012-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2914780524 / rank
 
Normal rank

Latest revision as of 11:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Acyclic domination
scientific article

    Statements

    Acyclic domination (English)
    0 references
    14 September 2000
    0 references
    A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). If, moreover, the subgraph \(\langle S\rangle\) of \(G\) induced by \(S\) contains no circuit, then \(S\) is an acyclic dominating set in \(G\). The minimum number of vertices of an acyclic dominating set in \(G\) is the acyclic domination number \(\gamma_a(G)\) of \(G\). In the paper this number is studied and compared with other numerical invariants of graphs concerning domination, mainly with the upper irredundance number \(\text{IR}(G)\) and the lower independence number \(\text{ir}(G)\).
    0 references
    acyclic dominating set
    0 references
    acyclic domination number
    0 references
    irredundance number
    0 references
    0 references
    0 references
    0 references

    Identifiers