## Abstract

A set *S* ⊂ *V* is a *dominating set* of a graph *G* = (*V*, *E*) if every vertex *υ* ∈ *V* which does not belong to *S* has a neighbour in *S*. The *domination number γ*(*G*) of the graph *G* is the minimum cardinality of a dominating set in *G*. A dominating set *S* is a *γ-set* in *G* if *|S|* = γ(*G*).

Some graphs have exponentially many *γ*-sets, hence it is worth to ask a question if a *γ*-set can be obtained by some transformations from another *γ*-set. The study of gamma graphs is an answer to this reconfiguration problem. We give a partial answer to the question which graphs are gamma graphs of trees. In the second section gamma graphs *γ.T* of trees with diameter not greater than five will be presented. It will be shown that hypercubes *Q _{k}* are among

*γ.T*graphs. In the third section

*γ.T*graphs of certain trees with three pendant vertices will be analysed. Additionally, some observations on the diameter of gamma graphs will be presented, in response to an open question, published by Fricke et al., if diam(

*T*(

*γ*)) =

*O*(

*n*)?

## Comments (0)