Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes

DOI10.1007/s12190-024-02064-wzbMATH Open1542.05049MaRDI QIDQ6584800

Hamidreza Maimani, Fatemeh Afzali, Amir Hossein Ghodrati

Publication date: 8 August 2024

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

Johnson graphhypercube graphKneser graphfailed zero forcing number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Cites Work

• On the complexity of failed zero forcing
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• The failed zero forcing number of a graph
• Zero forcing sets and the minimum rank of graphs
• A lower bound on the failed zero-forcing number of a graph

This page was built for publication: Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes