2-connected graphs with small 2-connected dominating sets. (Q1402083): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(03)00055-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000987306 / rank | |||
Normal rank |
Latest revision as of 10:07, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | 2-connected graphs with small 2-connected dominating sets. |
scientific article |
Statements
2-connected graphs with small 2-connected dominating sets. (English)
0 references
19 August 2003
0 references
The main result of the paper is the following. Let \(G\) be a \(2\)-connected graph with \(n\) vertices and minimum degree \(\delta\). Then \(\gamma_2 \leq n(\ln(\delta)/\delta)(1+o_{\delta}(1))\), where \(\gamma_2\) is the minimum size of a \(2\)-connected dominating set of \(G\) and \(o_{\delta}(1)\) denotes a function that tends to 0 as \(\delta \rightarrow \infty\). The proof uses the probabilistic method. This result extends similar results for \(\gamma_1\), the size of a minimum connected dominating set [see the authors and \textit{D. West}, SIAM J. Discrete Math. 13, No. 2, 202--211 (1998; Zbl 0941.05045), \textit{L. Lovász}, Discrete Math. 13, 383--390 (1975; Zbl 0323.05127)].
0 references
domination
0 references
probabilistic method
0 references