Failed zero forcing numbers of Grassmann graphs

DOI10.22108/TOC.2025.145774.2295MaRDI QIDQ6860790zbMATH OpenFDO

Authors Fatemeh Afzali, Amir Hossein Ghodrati, H. R. Maimani

Publication date 10 February 2026

Published in Transactions on Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22108/TOC.2025.145774.2295

zbMATH Keywords

Grassmann graphprojective planeaffine planefailed zero forcing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Blocking sets, ovals, (k)-arcs (51E21) Finite affine and projective planes (geometric aspects) (51E15)

Cites work

• scientific article; zbMATH DE number 3651315 (Why is no real title available?)
• A lower bound on the failed zero-forcing number of a graph
• Extremal combinatorics. With applications in computer science
• Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes
• 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

This page was built for publication: Failed zero forcing numbers of Grassmann graphs

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