No label defined (Q3340900)
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 3873384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3873384 |
Statements
1984
0 references
domination number
0 references
connected dominating set
0 references
0.9119717478752136
0 references
0.8960142135620117
0 references
0.8932141661643982
0 references
0.8902429342269897
0 references
[For the entire collection see Zbl 0543.00003.] A set D of vertices in a graph G is said to be a connected dominating set in G if every vertex in V(G)-D is adjacent to at least one vertex in D and the subgraph of G induced by D is connected. The connected domination number \(\gamma_ c(G)\) is the minimum number of vertices in a connected dominating set in G. The authors prove a number of results which relate \(\gamma_ c\) to other parameters of a graph, extending thereby results of \textit{E. Sampathkumar} and \textit{H. B. Walikar} [J. Math. Phys. Sci. 13, 607-613 (1979; Zbl 0449.05057)], \textit{J. Nieminen} [J. Inst. Math. Appl. 14, 183-187 (1974; Zbl 0288.05124)], and \textit{E. J. Cockayne, R. M. Dawes} and \textit{S. T. Hedetniemi} [Networks 10, 211-219 (1980; Zbl 0447.05039)].
0 references