On the doubly connected domination number of a graph (Q2501210): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11533-005-0003-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070510206 / rank
 
Normal rank

Revision as of 22:15, 19 March 2024

scientific article
Language Label Description Also known as
English
On the doubly connected domination number of a graph
scientific article

    Statements

    On the doubly connected domination number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2006
    0 references
    For a given connected graph \(G = (V,E)\), a set \(D\subseteq V(G)\) is a doubly connected dominating set if it is dominating and both \(\langle D\rangle\) and \(\langle V(G) - D\rangle\) are connected. The cardinality of the minimum doubly connected dominating set in \(G\) is the doubly connected domination number. This work investigates several properties of doubly connected dominating sets and gives some bounds on the doubly connected domination number.
    0 references

    Identifiers