2018
DOI: 10.48550/arxiv.1810.01583
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Which graphs occur as $γ$-graphs?

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 14 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?