Reconfiguration graphs of zero forcing sets

DOI10.1016/j.dam.2023.01.027OpenAlexW3082815643MaRDI QIDQ2686137

Ruth Haas, Leslie Hogben, Jesse T. 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) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classifying coloring graphs
• Zero forcing parameters and minimum rank problems
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• The minimum rank of symmetric matrices described by a graph: a survey
• Computational approaches for zero forcing and related problems
• Introduction to reconfiguration
• Connectedness of the graph of vertex-colourings
• Zero forcing sets and the minimum rank of graphs
• Improved bounds for sampling colorings
• Graph Theory
• The canonical coloring graph of trees and cycles
• Gray code numbers for graphs
• Randomly coloring sparse random graphs with fewer colors than the maximum degree
• Using variants of zero forcing to bound the inertia set of a graph
• The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• Improved Computational Approaches and Heuristics for Zero Forcing

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