Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Raksha, M.R.; Dominic, Charles Title A name given to the resource On the zero forcing number of complementary prism graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Communications in Combinatorics and Optimization;Volume;10;Issue;3;pp.519-530 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.22049/CCO.2023.27819.1362" target="_blank" rel="noreferrer noopener">https://doi.org/10.22049/CCO.2023.27819.1362</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105007075926?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105007075926?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant 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 Description An account of the resource 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. Subject The topic of the resource complementary prism graph; zero forcing number; zero forcing set Publisher An entity responsible for making the resource available Azarbaijan Shahid Madani University Relation A related resource ISSN: 25382128; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online