On the doubly connected domination number of a graph (Q2501210)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5051363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the doubly connected domination number of a graph |
scientific article; zbMATH DE number 5051363 |
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
0.9108446836471558
0 references
0.9041575193405152
0 references
0.901746153831482
0 references
0.9013798832893372
0 references
0.888449490070343
0 references
