{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:02Z","timestamp":1753884962299,"version":"3.41.2"},"reference-count":19,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:p> For a connected graph [Formula: see text] of order at least two, a total outer connected geodetic set\u00a0[Formula: see text] of a graph [Formula: see text] is an outer connected geodetic set such that the subgraph induced by [Formula: see text] has no isolated vertices. The minimum cardinality of a total outer connected geodetic set of [Formula: see text] is the total outer connected geodetic number of [Formula: see text] and is denoted by [Formula: see text]. We determine bounds for it and also find the total outer connected geodetic number for some special classes of graphs. It is shown that for positive integers [Formula: see text] and [Formula: see text] with [Formula: see text] there exists a connected graph [Formula: see text] with [Formula: see text] [Formula: see text] and [Formula: see text]. It is proved that for each triple [Formula: see text] and [Formula: see text] of positive integers with [Formula: see text], [Formula: see text] and [Formula: see text], there exists a connected graph [Formula: see text] of order [Formula: see text] such that [Formula: see text] and [Formula: see text]. It is also shown that for positive integers [Formula: see text] such that [Formula: see text] with [Formula: see text], there exists a connected graph [Formula: see text] such that [Formula: see text] and [Formula: see text], where [Formula: see text] is the outer connected geodetic number of a graph [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830922501282","type":"journal-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T17:08:44Z","timestamp":1658423324000},"source":"Crossref","is-referenced-by-count":2,"title":["More on the outer connected geodetic number of a graph"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2769-1991","authenticated-orcid":false,"given":"K.","family":"Ganesamoorthy","sequence":"first","affiliation":[{"name":"Department of Mathematics, Coimbatore Institute of Technology, Coimbatore 641 014, India"}]},{"given":"D.","family":"Jayanthi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Coimbatore Institute of Technology, Coimbatore 641 014, India"}]}],"member":"219","published-online":{"date-parts":[[2022,8,9]]},"reference":[{"issue":"13","key":"S1793830922501282BIB001","doi-asserted-by":"crossref","first-page":"4297","DOI":"10.2298\/FIL1713297A","volume":"31","author":"Abdollahzadeh Ahangar H.","year":"2017","journal-title":"Filomat"},{"issue":"3","key":"S1793830922501282BIB002","first-page":"323","volume":"126","author":"Abdollahzadeh Ahangar H.","year":"2016","journal-title":"Ars Combin."},{"issue":"6","key":"S1793830922501282BIB003","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.2298\/FIL1506361A","volume":"29","author":"Abdollahzadeh Ahangar H.","year":"2015","journal-title":"Filomat"},{"key":"S1793830922501282BIB004","first-page":"253","volume":"100","author":"Abdollahzadeh Ahangar H.","year":"2016","journal-title":"Util. Math."},{"volume-title":"Structural Analysis of Complex Networks","year":"2011","author":"Bre\u0161ar B.","key":"S1793830922501282BIB005"},{"volume-title":"Distance in Graphs","year":"1990","author":"Buckley F.","key":"S1793830922501282BIB006"},{"key":"S1793830922501282BIB007","first-page":"51","volume":"31","author":"Chartrand G.","year":"2001","journal-title":"Bull. ICA"},{"issue":"1","key":"S1793830922501282BIB008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.10007","volume":"39","author":"Chartrand G.","year":"2002","journal-title":"Networks"},{"key":"S1793830922501282BIB009","first-page":"3","volume":"72","author":"Chartrand G.","year":"2004","journal-title":"Ars Combin."},{"issue":"122","key":"S1793830922501282BIB010","doi-asserted-by":"crossref","first-page":"79","DOI":"10.2298\/PIM2022079G","volume":"108","author":"Ganesamoorthy K.","year":"2020","journal-title":"Publ. Inst. Math."},{"key":"S1793830922501282BIB011","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s40010-020-00661-5","volume":"91","author":"Ganesamoorthy K.","year":"2021","journal-title":"Proc. Natl. Acad. Sci. India Sect. A Phys. Sci."},{"issue":"1","key":"S1793830922501282BIB012","first-page":"78","volume":"41","author":"Ganesamoorthy K.","year":"2021","journal-title":"Trans. Natl. Acad. Sci. Azerb. Ser. Phys.-Tech. Math. Sci. Mathematics"},{"issue":"1","key":"S1793830922501282BIB013","doi-asserted-by":"crossref","first-page":"2142022","DOI":"10.1142\/S0219265921420226","volume":"22","author":"Ganesamoorthy K.","year":"2022","journal-title":"J. Interconnect. Networks"},{"key":"S1793830922501282BIB014","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"issue":"11","key":"S1793830922501282BIB015","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","volume":"17","author":"Harary F.","year":"1993","journal-title":"Math. Comput. Model."},{"key":"S1793830922501282BIB016","first-page":"161","volume":"143","author":"Muntean R.","year":"2000","journal-title":"Congr. Numer."},{"key":"S1793830922501282BIB017","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(73)90116-7","volume":"4","author":"Ostrand P. A.","year":"1973","journal-title":"Discrete Math."},{"key":"S1793830922501282BIB018","first-page":"2250100","author":"Santhakumaran A. P.","year":"2022","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"S1793830922501282BIB019","first-page":"172","volume":"42","author":"Santhakumaran A. P.","year":"2022","journal-title":"Trans. Natl. Acad. Sci. Azerb. Ser. Phys.-Tech. Math. Sci. Mathematics"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T03:18:25Z","timestamp":1684811905000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,9]]},"references-count":19,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["10.1142\/S1793830922501282"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501282","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,8,9]]},"article-number":"2250128"}}