On the sum of the total domination numbers of a digraph and its converse
Sign Up to like & getrecommendations! Published in 2019 at "Quaestiones Mathematicae"
DOI: 10.2989/16073606.2018.1438531
Abstract: Abstract A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S has an in-neighbor in S. A dominating set S of D is called… read more here.
Keywords: domination numbers; converse; total domination; dominating set ... See more keywords
Graphs with equal domination and certified domination numbers
Sign Up to like & getrecommendations! Published in 2019 at "Opuscula Mathematica"
DOI: 10.7494/opmath.2019.39.6.815
Abstract: A set \(D\) of vertices of a graph \(G=(V_G,E_G)\) is a dominating set of \(G\) if every vertex in \(V_G-D\) is adjacent to at least one vertex in \(D\). The domination number (upper domination number,… read more here.
Keywords: domination certified; domination number; domination numbers; dominating set ... See more keywords