{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:23:54Z","timestamp":1649121834260},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> A set [Formula: see text] is a near geodetic set if for every [Formula: see text] in [Formula: see text] there exist some [Formula: see text] in [Formula: see text] with [Formula: see text] The near geodetic number [Formula: see text] is the minimum cardinality of a near geodetic set in [Formula: see text] A subset [Formula: see text] of a minimum near geodetic set [Formula: see text] is called the forcing subset of [Formula: see text] if [Formula: see text] is the unique minimum near geodetic set containing [Formula: see text]. The forcing number [Formula: see text] of [Formula: see text] in [Formula: see text] is the minimum cardinality of a forcing subset for [Formula: see text], while the forcing near geodetic number [Formula: see text] of [Formula: see text] is the smallest forcing number among all minimum near geodetic sets of [Formula: see text]. In this paper, we initiate the study of forcing near geodetic number of connected graphs. We characterize graphs with [Formula: see text]. Further, we compare the parameters geodetic number[Formula: see text] near geodetic number[Formula: see text] forcing near geodetic number and we proved that, for every positive integers [Formula: see text] and [Formula: see text] with [Formula: see text] and [Formula: see text], there exists a nontrivial connected graph [Formula: see text] with [Formula: see text] [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830920500299","type":"journal-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T07:51:14Z","timestamp":1580370674000},"page":"2050029","source":"Crossref","is-referenced-by-count":0,"title":["The forcing near geodetic number of a graph"],"prefix":"10.1142","volume":"12","author":[{"given":"R.","family":"Lenin","sequence":"first","affiliation":[{"name":"Department of Mathematics St.Joseph\u2019s College, Tiruchirappalli, Tamilnadu, India"}]}],"member":"219","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"key":"S1793830920500299BIB001","volume-title":"Distance in Graphs","author":"Buckley F.","year":"1990"},{"key":"S1793830920500299BIB002","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1084"},{"key":"S1793830920500299BIB003","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1112"},{"key":"S1793830920500299BIB004","first-page":"51","volume":"31","author":"Chartrand G.","year":"2001","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830920500299BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/net.10007"},{"key":"S1793830920500299BIB006","first-page":"37","volume":"156","author":"Chartrand G.","year":"2002","journal-title":"Congr. Numer."},{"key":"S1793830920500299BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90259-2"},{"key":"S1793830920500299BIB008","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2016.1248689"},{"key":"S1793830920500299BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.03.023"},{"key":"S1793830920500299BIB010","volume-title":"The Interval Function of a Graph","author":"Mulder H. M.","year":"1980"},{"key":"S1793830920500299BIB011","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2007.10698129"},{"key":"S1793830920500299BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.005"},{"key":"S1793830920500299BIB013","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1569"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T05:59:34Z","timestamp":1589781574000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,25]]},"references-count":13,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S1793830920500299"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500299","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,25]]}}}