γ-graphs of graphs

Gerd H. Fricke, et al. "γ-graphs of graphs." Discussiones Mathematicae Graph Theory 31.3 (2011): 517-531. <http://eudml.org/doc/270927>.

@article{GerdH2011,
abstract = {A set S ⊆ V is a dominating set of a graph G = (V,E) if every vertex in V -S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set S in G; we say that such a set S is a γ-set. In this paper we consider the family of all γ-sets in a graph G and we define the γ-graph G(γ) = (V(γ), E(γ)) of G to be the graph whose vertices V(γ) correspond 1-to-1 with the γ-sets of G, and two γ-sets, say D₁ and D₂, are adjacent in E(γ) if there exists a vertex v ∈ D₁ and a vertex w ∈ D₂ such that v is adjacent to w and D₁ = D₂ - \{w\} ∪ \{v\}, or equivalently, D₂ = D₁ - \{v\} ∪ \{w\}. In this paper we initiate the study of γ-graphs of graphs.},
author = {Gerd H. Fricke, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {dominating sets; gamma graphs},
language = {eng},
number = {3},
pages = {517-531},
title = {γ-graphs of graphs},
url = {http://eudml.org/doc/270927},
volume = {31},
year = {2011},
}

TY - JOUR
AU - Gerd H. Fricke
AU - Sandra M. Hedetniemi
AU - Stephen T. Hedetniemi
AU - Kevin R. Hutson
TI - γ-graphs of graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2011
VL - 31
IS - 3
SP - 517
EP - 531
AB - A set S ⊆ V is a dominating set of a graph G = (V,E) if every vertex in V -S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set S in G; we say that such a set S is a γ-set. In this paper we consider the family of all γ-sets in a graph G and we define the γ-graph G(γ) = (V(γ), E(γ)) of G to be the graph whose vertices V(γ) correspond 1-to-1 with the γ-sets of G, and two γ-sets, say D₁ and D₂, are adjacent in E(γ) if there exists a vertex v ∈ D₁ and a vertex w ∈ D₂ such that v is adjacent to w and D₁ = D₂ - {w} ∪ {v}, or equivalently, D₂ = D₁ - {v} ∪ {w}. In this paper we initiate the study of γ-graphs of graphs.
LA - eng
KW - dominating sets; gamma graphs
UR - http://eudml.org/doc/270927
ER -