Abstract:The γ-graph of a graph G is the graph whose vertices are labelled by the minimum dominating sets of G, in which two vertices are adjacent when their corresponding minimum dominating sets (each of size γ(G)) intersect in a set of size γ(G) − 1. We extend the notion of a γ-graph from distance-1-domination to distance-d-domination, and ask which graphs H occur as γgraphs for a given value of d ≥ 1. We show that, for all d, the answer depends only on whether the vertices of H admit a labelling consistent with the … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.