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 Articles 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/. Title A name given to the resource Connected k-forcing sets of graphs and splitting graphs Subject The topic of the resource Connected k-forcing number; K-forcing number; Zeroforcing number Description An account of the resource The notion of k-forcing number of a graph was introduced by Amos et al. For a given graph G and a given subset I of the vertices of the graph G, the vertices in I are known as initially colored black vertices and the vertices in V (G) ? I are known as not initially colored black vertices or white vertices. The set I is a k-forcing set of a graph G if all vertices in G eventually colored black after applying the following color changing rule: If a black colored vertex is adjacent to at most k-white vertices, then the white vertices change to be colored black. The cardinality of a smallest k-forcing set is known as the k-forcing number Zk (G) of the graph G. If the sub graph induced by the vertices in I are connected, then I is called the connected k-forcing set. The minimum cardinality of such a set is called the connected k-forcing number of G and is denoted by Zck (G). This manuscript is intended to study the connected k-forcing number of graphs and the splitting graphs. 2020 the author(s). Creator An entity primarily responsible for making the resource Premodkmuar K.P.; Dominic C.; Chacko B. Source A related resource from which the described resource is derived Journal of Mathematical and Computational Science, Vol-10, No. 3, pp. 656-680. Publisher An entity responsible for making the resource available SCIK Publishing Corporation Date A point or period of time associated with an event in the lifecycle of the resource 2020-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.28919/jmcs/4446" target="_blank" rel="noreferrer noopener">https://doi.org/10.28919/jmcs/4446</a> <br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085742286&amp;doi=10.28919%2Fjmcs%2F4446&amp;partnerID=40&amp;md5=253abf45a55e32889618c952f29db5b6" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085742286&amp;doi=10.28919%2fjmcs%2f4446&amp;partnerID=40&amp;md5=253abf45a55e32889618c952f29db5b6</a> Rights Information about rights held in and over the resource All Open Access; Gold Open Access Relation A related resource ISSN: 19275307 Format The file format, physical medium, or dimensions of the resource Online Language A language of the resource English Type The nature or genre of the resource Article Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Premodkmuar K.P., Research Center of Mathematics, St. Josephs College, Devagiri, Calicut, Kerala, India; Dominic C., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, India; Chacko B., Research Center of Mathematics, St. Josephs College, Devagiri, Calicut, Kerala, India