Login / Signup
Partitioning the vertex set of G to make G ☐ H an efficient open domination graph.
Tadeja Kraner Sumenjak
Iztok Peterin
Douglas F. Rall
Aleksandra Tepeh
Published in:
Discret. Math. Theor. Comput. Sci. (2016)
Keyphrases
</>
vertex set
weighted graph
undirected graph
random graphs
maximum distance
connected components
query processing
graphical models