Reconfiguration graphs of zero forcing sets

DOI10.1016/J.DAM.2023.01.027MaRDI QIDQ2686137zbMATH OpenOpenAlexFDO

Authors Ruth Haas, Leslie Hogben, Jesse Geneson

Publication date 24 February 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.00220

zbMATH Keywords

reconfigurationzero forcingzero forcing graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Reconfiguration graphs for dominating sets
• Zero forcing sets and the minimum rank of graphs
• The Zero Forcing Number of Graphs
• On Zero Forcing Number of Permutation Graphs
• On the zero forcing number of bijection graphs
• On zero forcing number of graphs and their complements
• The zero forcing polynomial of a graph
• On graphs maximizing the zero forcing number
• On minimum rank and zero forcing sets of a graph
• Zero forcing sets and bipartite circulants

Cites work

• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• Classifying coloring graphs
• Computational approaches for zero forcing and related problems
• Connectedness of the graph of vertex-colourings
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Graph theory
• Gray code numbers for graphs
• scientific article; zbMATH DE number 5130739 (Why is no real title available?)
• scientific article; zbMATH DE number 7272506 (Why is no real title available?)
• Improved bounds for sampling colorings
• Improved Computational Approaches and Heuristics for Zero Forcing
• Introduction to reconfiguration
• Randomly coloring sparse random graphs with fewer colors than the maximum degree
• The canonical coloring graphs of trees and cycles
• The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
• The minimum rank of symmetric matrices described by a graph: a survey
• Using variants of zero forcing to bound the inertia set of a graph
• Zero forcing and power domination for graph products
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(11)

• Logic circuits from zero forcing
• Complexity and computation of connected zero forcing
• Reconfiguration graphs for dominating sets
• Isomorphisms and properties of TAR graphs for zero forcing and other X-set parameters
• Reconfiguration graphs of zero forcing sets
• Minimal zero forcing sets
• Well-forced graphs
• Exploring the influence of graph operations on zero forcing sets
• TAR reconfiguration for vertex set parameters
• Zero forcing irredundant sets
• Forts, (fractional) zero forcing, and Cartesian products of graphs

This page was built for publication: Reconfiguration graphs of zero forcing sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686137)