Total Domination on Tree Operators
Total Domination on Tree Operators
Abstract Let G be a graph with vertex set V and edge set E , a set $$D\subseteq V$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>D</mml:mi> <mml:mo>⊆</mml:mo> <mml:mi>V</mml:mi> </mml:mrow> </mml:math> is a total dominating set if every vertex $$v\in V$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>v</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>V</mml:mi> </mml:mrow> </mml:math> has at least one neighbor …