On the zero forcing number of complementary prism graphs

DOI10.22049/CCO.2023.27819.1362MaRDI QIDQ6917386zbMATH OpenFDO

Authors M. R. Raksha, Charles Dominic

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.27819.1362

zbMATH Keywords

complementary prism graphzero forcing numberzero forcing set

Mathematics Subject Classification ID

Vertex degrees (05C07) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• Extremal values and bounds for the zero forcing number
• Logic circuits from zero forcing
• On zero forcing number of graphs and their complements
• Proof of a conjecture on the zero forcing number of a graph
• Roman domination in complementary prism graphs
• Some bounds on the zero forcing number of a graph
• The complementary product of two graphs
• The Zero Forcing Number of Graphs
• Throttling zero forcing propagation speed on graphs
• Zero forcing number for Cartesian product of some graphs
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: On the zero forcing number of complementary prism graphs

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