Zero forcing number for Cartesian product of some graphs

DOI10.22049/CCO.2023.28177.1471MaRDI QIDQ6917422zbMATH OpenFDO

Authors Zeinab Montazeri, Nasrin Soltankhah

Publication date 13 October 2025

Published in Communications in Combinatorics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.22049/CCO.2023.28177.1471

zbMATH Keywords

generalized Rook's graphzero forcing number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• Complexity and computation of connected zero forcing
• Fast-mixed searching and related problems on graphs
• Iteration index of a zero forcing set in a graph
• Nondiscriminatory propagation on trees
• On the relationships between zero forcing numbers and certain graph coverings
• Propagation time for zero forcing on a graph
• Zero forcing and power domination for graph products
• Zero forcing sets and the minimum rank of graphs

Cited in

(2)

• Zero forcing number and propagation time discrepancy of some graphs
• On the zero forcing number of complementary prism graphs

This page was built for publication: Zero forcing number for Cartesian product of some graphs

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