Sign Up to like & get
recommendations!
0
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