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

DOI10.1007/S12190-024-02064-WMaRDI QIDQ6584800zbMATH OpenFDO

Authors Fatemeh Afzali, Amir Hossein Ghodrati, Hamid Reza Maimani

Publication date 8 August 2024

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

Full work available at URL https://doi.org/10.1007/S12190-024-02064-W

zbMATH Keywords

failed zero forcing numberhypercube graphJohnson graphKneser graph

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(2)

• Failed zero forcing numbers of Grassmann graphs
• Forts, (fractional) zero forcing, and Cartesian products of graphs

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

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