On the doubly connected domination number of a graph (Q2501210): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q251335 |
||
Property / author | |||
Property / author: Magdalena Lemańska / rank | |||
Revision as of 19:19, 11 February 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