We consider gamma-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. We answer three open questions about gamma-graphs of trees by providing upper bounds on the maximum degree, the diameter, and the number of minimum dominating sets. The latter gives an upper bound on the order of the gamma-graph.
机构:
National Research University Higher School of Economics, Nizhny NovgorodBranch, Nizhny Novgorod
Lobachevsky State University of Nizhny Novgorod, Nizhny NovgorodNational Research University Higher School of Economics, Nizhny NovgorodBranch, Nizhny Novgorod