Graphs with double domination numbers
This article deals with double domination in graphs. A vertex in a graph is considered to be dominating itself and its neighbours; a set \(S\) of vertices is double dominating if \(S\) dominates every vertex of the graph at least twice. The double domination number \(\gamma_{\times2}\) is defined as the minimum cardinality of \(S\). In the first two sections, a short background on domination is presented including the current best bound on the double domination number for graphs \(G\) where \(\delta(G)\geq2\) which is \(\gamma_{\times2}\leq 11n/13\), with \(n\) the order of the graph. The author continues by presenting the main result of the paper, which is to improve the above bound to \(\gamma_{\times2}\leq 3n/4\), for graphs \(G\neq C_5\). The article then continues by characterizing the graphs that achieve equality. Full proofs are presented throughout this very interesting article on graph domination.
- Double total domination of graphs
- A note on double domination in graphs
- Some graphs with double domination subdivision number three
- Restricted domination parameters in graphs
- Bounds on double domination numbers of graphs
- Multiple domination
- Some upper bounds for the domination number
- scientific article; zbMATH DE number 2155177 (Why is no real title available?)
- An algorithm to check the equality of total domination number and double of domination number in graphs
- On Double Domination in Graphs
- Exact double domination in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
This page was built for publication: Graphs with double domination numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316254)
