Corpus ID: 221397209

# Reconfiguration graphs of zero forcing sets

@article{Geneson2020ReconfigurationGO,
title={Reconfiguration graphs of zero forcing sets},
author={Jesse T. Geneson and Ruth Haas and Leslie Hogben},
journal={ArXiv},
year={2020},
volume={abs/2009.00220}
}
• Published 1 September 2020
• Mathematics, Computer Science
• ArXiv
This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the zero forcing graph. Given a base graph $G$, its zero forcing graph, $\mathscr{Z}(G)$, is the graph whose vertices are the minimum zero forcing sets of $G$ with an edge between vertices $B$ and $B'$ of $\mathscr{Z}(G)$ if and only if $B$ can be obtained from $B'$ by changing a single vertex of $G$. It is shown that the zero forcing graph of a forest is connected, but that many zero forcing graphs are… Expand
1 Citations

#### Figures from this paper

Graphs with unique zero forcing sets and Grundy dominating sets
• Computer Science, Mathematics
• ArXiv
• 2021
This work investigates both variations of uniqueness for several concepts of Grundy domination, which first appeared in the context of domination games, yet they are also closely related to zero forcing. Expand

#### References

SHOWING 1-10 OF 22 REFERENCES
Reconfiguration of Colourings and Dominating Sets in Graphs
• Computer Science, Mathematics
• 2019
Different types of domination reconfiguration graphs are obtained, depending on whether vertices are exchanged along edges or not, when the dominating sets are restricted to be minimum dominating sets. Expand
The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
It is proved that the Glauber dynamics on the C-colorings of a graph G on n vertices with girth g and maximum degree $\Delta$ mixes rapidly if (i) C=q\Delta$and$q>q^*$, which improves the bound of roughly$1.763\ Delta$obtained by Dyer and Frieze for the same class of graphs. Expand Zero forcing parameters and minimum rank problems The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matricesExpand Zero forcing sets and minimum rank of graphs A new graph parameter, Z(G), is introduced that is the minimum size of a zero forcing set of vertices and uses it to bound the minimum rank for numerous families of graphs, often enabling computation of the minimumRank. Expand The canonical coloring graph of trees and cycles • R. Haas • Computer Science, Mathematics • Ars Math. Contemp. • 2012 It is shown that every graph has a canonical coloring graph which is disconnected; that trees have canonical coloring graphs that are Hamiltonian; and cycles have canonical colorings that are connected. Expand Connectedness of the graph of vertex-colourings • Computer Science, Mathematics • Discret. Math. • 2008 It is shown that if G has chromatic number k@?{2,3}, then C"k(G) is not connected, and on the other hand, for k>=4 there are graphs with chromaticNumber k for which C"K(G), the k-colour graph of G, is notconnected, and there are k-chromatic graphs for which it is connected. Expand Random sampling for the monomer-dimer model on a lattice. Probabilistic techniques in equilibrium and nonequilibrium statistical physics • Mathematics • 1999 In the monomer-dimer model on a graph, each matching (collection of non-overlapping edges)${M}$has a probability proportional to$\lambda^{|M|}$, where$\lambda < 0\$ is the model parameter, andExpand
Minimum Rank, Maximum Nullity, and Zero Forcing Number of Graphs
• Mathematics
• 2014
This chapter represents an overview of research related to a notion of the “rank of a graph" and the dual concept known as the “nullity of a graph," from the point of view of associating a fixedExpand
Classifying coloring graphs
• Computer Science, Mathematics
• Discret. Math.
• 2016
This paper considers the question: Which graphs can be coloring graphs and answers the question for several classes of graphs involving order, girth, and induced subgraphs. Expand
Gray code numbers for graphs
• Mathematics, Computer Science
• Ars Math. Contemp.
• 2011
It is proved that for any graph H, there is a least integer k 0 ( H ) such that H has a Gray code of k -colourings whenever k ≥ k0 ( H ), which is determined whenever H is a complete graph, tree, or cycle. Expand