{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:34Z","timestamp":1740155974503,"version":"3.37.3"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:p> A set S of vertices in a connected graph [Formula: see text] is called a geodetic set if every vertex not in [Formula: see text] lies on a shortest path between two vertices from [Formula: see text]. A set [Formula: see text] of vertices in [Formula: see text] is called a dominating set of [Formula: see text] if every vertex not in [Formula: see text] has at least one neighbor in [Formula: see text]. A set [Formula: see text] is called a geodetic global dominating set of [Formula: see text] if [Formula: see text] is both geodetic and global dominating set of [Formula: see text]. The geodetic global domination number is the minimum cardinality of a geodetic global dominating set in [Formula: see text]. In this paper, we determine the geodetic global domination number of the corona and strong products of two graphs. <\/jats:p>","DOI":"10.1142\/s1793830920500433","type":"journal-article","created":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T07:40:25Z","timestamp":1584430825000},"page":"2050043","source":"Crossref","is-referenced-by-count":4,"title":["Geodetic global domination in corona and strong product of graphs"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9263-6492","authenticated-orcid":false,"given":"X. Lenin","family":"Xaviour","sequence":"first","affiliation":[{"name":"Department of Mathematics, Scott Christian College, Nagercoil 629003, Tamil Nadu, India"},{"name":"Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli 627012, Tamil Nadu, India"}]},{"given":"S. Robinson","family":"Chellathurai","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Scott Christian College, Nagercoil 629003, Tamil Nadu, India"}]}],"member":"219","published-online":{"date-parts":[[2020,7,25]]},"reference":[{"volume-title":"Distance in Graphs","year":"1990","author":"Buckley F.","key":"S1793830920500433BIB001"},{"key":"S1793830920500433BIB002","doi-asserted-by":"publisher","DOI":"10.1002\/net.10007"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S1793830920500433BIB003"},{"issue":"4","key":"S1793830920500433BIB004","first-page":"29","volume":"9","author":"Chellathurai S. Robinson","year":"2018","journal-title":"Int. J. Math. Arch."},{"key":"S1793830920500433BIB005","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2013.867675"},{"issue":"5","key":"S1793830920500433BIB006","first-page":"377","volume":"23","author":"Kumar E. Sampath","year":"1989","journal-title":"J. Math. Phys. Sci."},{"key":"S1793830920500433BIB007","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001","edition":"2"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T09:57:36Z","timestamp":1597312656000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,25]]},"references-count":7,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["10.1142\/S1793830920500433"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500433","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,7,25]]}}}