92 citations · 103 across the 9 of their papers we have counts for
9 papers · 1 filter
Isomorphisms and properties of TAR reconfiguration graphs for zero forcing and other -set parameters
Novi H. Bong, Joshua Carlson, Bryan Curtis +2
An -TAR (token addition/removal) reconfiguration graph has as its vertices sets that satisfy some property , with an edge between two sets if one is obtained from the other b…
Reconfiguration graphs of zero forcing sets
Jesse Geneson, Ruth Haas, Leslie Hogben
This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the zero forcing graph. Given a base graph , its zero forcing graph, …
Reconfiguration graphs of shortest paths
John Asplund, Kossi Edoh, Ruth Haas +3
For a graph and , the shortest path reconfiguration graph of with respect to and is denoted by . The vertex set of is the set of a…
Triangle-free Uniquely 3-Edge Colorable Cubic Graphs
Sarah-Marie Belcastro, Ruth Haas
This paper presents infinitely many new examples of triangle-free uniquely 3-edge colorable cubic graphs. The only such graph previously known was given by Tutte in 1976.
Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
sarah-marie belcastro, Ruth Haas
Two edge colorings of a graph are {\em edge-Kempe equivalent} if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number…
The -Dominating Graph
Ruth Haas, Karen Seyffarth
Given a graph , the -dominating graph of , , is defined to be the graph whose vertices correspond to the dominating sets of that have cardinality at most .…