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 Two distance forcing number of a graph Subject The topic of the resource 2-distance forcing number; Diameter; Graph; K-forcing number Description An account of the resource Motivated from the graph parameters namely zero forcing number, k-forcing number and the connected k-forcing number, in this article, we introduce a new parameter known as the 2-distance forcing number. Assume that each vertex of a graph G = (V (G), E(G)) is colored as either white or black. Consider the set Z2d of black colored vertices of the graph G. The color change rule changes the color of a white vertex v to black if the white vertex v is the only 2-distance white neighbor of a black vertex u. The set Z2d is called a two distance forcing set of G if all vertices of the graph G will be turned black after limited applications of the color change rule. The 2-distance forcing number of G, denoted by Z2d (G), is the minimum of | Z2d | over all 2-distance forcing sets Z2d ? V (G). This manuscript is intended to study the 2-distance forcing number of some graphs. We find the exact value of the 2-distance forcing number of graphs such as the pineapple graph, gear graph, jelly fish graph, helm graph, sunflower graph, comet graph and the n-pan graph. 2020 the author(s). Creator An entity primarily responsible for making the resource Premodkumar 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. 6, pp. 2233-2248. 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/4842" target="_blank" rel="noreferrer noopener">https://doi.org/10.28919/jmcs/4842</a> <br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090662321&amp;doi=10.28919%2Fjmcs%2F4842&amp;partnerID=40&amp;md5=a2c9db9e7c968b4f1c8380890520770a" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090662321&amp;doi=10.28919%2fjmcs%2f4842&amp;partnerID=40&amp;md5=a2c9db9e7c968b4f1c8380890520770a</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 Premodkumar K.P., P.G. Department and 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., P.G. Department and Research Center of Mathematics, St. Josephs College, Devagiri, Calicut, Kerala, India