On the zero forcing number of complementary prism graphs
complementary prism graph; zero forcing number; zero forcing set
The zero forcing number of a graph is the minimum cardinality among all the zero forcing sets of a graph G. The aim of this article is to compute the zero forcing number of complementary prism graphs. Some bounds on the zero forcing number of complementary prism graphs are presented. The remainder of this article discusses the following result. Let G and ? be connected graphs. Then Z(G?) ? n ? 1 if and only if there exists two vertices vi, vj ? V (G) and i 6? j such that, either N(vi) ? N(vj) or N[vi] ? N[vj] in G. 2025 Azarbaijan Shahid Madani University.
Communications in Combinatorics and Optimization;Volume;10;Issue;3;pp.519-530
Restricted Access; Hardcopy may be available in the library
https://doi.org/10.22049/CCO.2023.27819.1362 https://www.scopus.com/pages/publications/105007075926?origin=resultslist
Raksha M.R., Department of Mathematics, CHRIST (Deemed to be university), Karnataka, Bengaluru, 560029, India, Department of Mathematics, RV College of Engineering, Karnataka, Bengaluru, 560059, India; Dominic C., Department of Mathematics, CHRIST (Deemed to be university), Karnataka, Bengaluru, 560029, India