Isomorphisms and properties of TAR reconfiguration graphs for zero forcing and other $X$-set parameters

An $X$-TAR (token addition/removal) reconfiguration graph has as its vertices sets that satisfy some property $X$, with an edge between two sets if one is obtained from the other by adding or removing one element. This paper considers the $X$-TAR graph for $X-$ sets of vertices of a base graph $G$ where the $X$-sets of $G$ must satisfy certain conditions. Dominating sets, power dominating sets, zero forcing sets, and positive semidefinite zero forcing sets are all examples of $X$-sets. For graphs $G$ and $G'$ with no isolated vertices, it is shown that $G$ and $G'$ have isomorphic $X$-TAR reconfiguration graphs if and only if there is a relabeling of the vertices of $G'$ such that $G$ and $G'$ have exactly the same $X$-sets. The concept of an $X$-irrelevant vertex is introduced to facilitate analysis of $X$-TAR graph isomorphisms. Furthermore, results related to the connectedness of the zero forcing TAR graph are given. We present families of graphs that exceed known lower bounds for connectedness parameters.

No reviews yet.

No comments yet.