On the doubly connected domination number of a graph (Q2501210): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11533-005-0003-4 / rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some inequalities about connected domination number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Hadwiger's Number and the Stability Number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3340900 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3895508 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11533-005-0003-4 / rank | |||
Normal rank |
Latest revision as of 02:10, 19 December 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
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