Domination and total domination in cubic graphs of large girth


The domination number γ(G) and the total domination number γt(G) of a graph G without an isolated vertex are among the most well studied parameters in graph theory. While the inequality γt(G) ≤ 2γ(G) is an almost immediate consequence of the definition, the extremal graphs for this inequality are not well understood. Furthermore, even very strong additional… (More)
DOI: 10.1016/j.dam.2014.04.011


  • Presentations referencing similar topics