scientific article; zbMATH DE number 2076802
A subset \(D\) of the vertex set of a graph \(G\) is called total dominating in \(G\), if each vertex of \(G\) (including the vertices of \(D\) themselves) is adjacent to a vertex of \(D\). The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma_t(G)\) of \(G\). \textit{O. Favaron}, \textit{M. A. Henning}, \textit{C. M. Mynhart} and \textit{J. Puech} [J. Graph Theory 34, 9--19 (2000; Zbl 0945.05047)] conjectured that \(\gamma_t(G)\leq n /2\), where \(n\) is the number of vertices of \(G\). Now let \(\delta\) be the minimum degree of a vertex in \(G\) and let \(\delta> 1\). In this paper it is proved that \(\gamma_t(G)\leq {1+\ln(2\delta)\over\delta} n\). This proves the above-mentioned conjecture at \(\delta\geq 8\). The paper ends by a ``note added in proof. In it the author informs that the original conjecture \(\gamma_t(G)\leq n/2\) was proved by Peter Che Bor Lam and Bing Wei.
- Upper bounds on the domination number of a graph in terms of order and minimum degree.
- Bounds related to domination in graphs with minimum degree two
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Bounds on the maximum number of minimum dominating sets
- scientific article; zbMATH DE number 861318
- Lower bounds on the total domination number of a graph
- Domination, radius, and minimum degree
- Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- Upper bounds on the total domination number
- Total domination in partitioned graphs
- Essential upper bounds on the total domination number
- scientific article; zbMATH DE number 6383811 (Why is no real title available?)
- Relationships between total domination, order, size, and maximum degree of graphs
- scientific article; zbMATH DE number 19197 (Why is no real title available?)
- scientific article; zbMATH DE number 4127268 (Why is no real title available?)
- Some remarks on domination
- scientific article; zbMATH DE number 1462928 (Why is no real title available?)
- scientific article; zbMATH DE number 1895061 (Why is no real title available?)
- scientific article; zbMATH DE number 861318 (Why is no real title available?)
- Lower bounds on the total domination number of a graph
- Optimal linear‐Vizing relationships for (total) domination in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470232)