# $\gamma$-Graphs of Trees

## TL;DR

This paper investigates the structure of $\gamma$-graphs derived from trees, providing an algorithm for their determination, characterizations, and exploring their connections with Cartesian product graphs.

## Contribution

It introduces an algorithm to find $\gamma$-graphs of trees and characterizes which trees can be $\gamma$-graphs of other trees, advancing understanding of their structural properties.

## Key findings

- Developed an algorithm for $\gamma$-graphs of trees
- Characterized trees that are $\gamma$-graphs of trees
- Explored connections with Cartesian product graphs

## Abstract

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in $G(\gamma)$ if they differ by a single vertex and the two different vertices are adjacent in $G$. In this paper, we consider $\gamma$-graphs of trees. We develop an algorithm for determining the $\gamma$-graph of a tree, characterize which trees are $\gamma$-graphs of trees, and further comment on the structure of $\gamma$-graphs of trees and its connections with Cartesian product graphs, the set of graphs which can be obtained from the Cartesian product of graphs of order at least two.