Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters
DOI10.1007/s00373-023-02677-1zbMath1519.05173arXiv2205.09668MaRDI QIDQ6166671
Novi H. Bong, Bryan A. Curtis, Ruth Haas, Leslie Hogben, Joshua Carlson
Publication date: 3 August 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.09668
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Zero forcing parameters and minimum rank problems
- Connected \(k\)-dominating graphs
- The zero forcing polynomial of a graph
- The \(k\)-dominating graph
- Reconfiguration graphs for dominating sets
- Hamilton paths in dominating graphs of trees and cycles
- Introduction to reconfiguration
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- Zero forcing sets and the minimum rank of graphs
- Reconfiguration graphs of zero forcing sets
- γ-graphs of graphs
- Inverse Problems and Zero Forcing for Graphs
- Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters
This page was built for publication: Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters