The \(q\)-analogue of zero forcing for certain families of graphs
DOI10.1016/j.dam.2024.01.014arXiv2306.01138OpenAlexW4391294907MaRDI QIDQ6124425
A. Sarobidy Razafimahatratra, Karen Meagher, Roghayeh Maleki, Brett Stevens, Mahsa N. Shirazi, Shaun M. Fallat, Shahla Nasserasr, Seyed Ahmad Mojallal, Neha Joshi
Publication date: 27 March 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.01138
treesCartesian productKneser graphthreshold graphsmaximum nullityzero forcingvariants of zero forcing
Trees (05C05) Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- Degree maximal graphs are Laplacian integral
- Properties of a \(q\)-analogue of zero forcing
- On the zero forcing number of a graph involving some classical parameters
- Zero forcing sets and the minimum rank of graphs
- Positive semidefinite maximum nullity and zero forcing number
- Using variants of zero forcing to bound the inertia set of a graph
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Grundy domination and zero forcing in Kneser graphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: The \(q\)-analogue of zero forcing for certain families of graphs
