{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:24:48Z","timestamp":1753885488362,"version":"3.41.2"},"reference-count":43,"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":[[2024,5]]},"abstract":"<jats:p> Let [Formula: see text] and [Formula: see text] be positive integers, and let [Formula: see text] be a simple and connected graph with vertex set [Formula: see text]. For [Formula: see text], let [Formula: see text] denote the length of an [Formula: see text] geodesic in [Formula: see text] and let [Formula: see text]. Let [Formula: see text]. A set [Formula: see text] is a distance-[Formula: see text] locating set of [Formula: see text] if, for any distinct [Formula: see text], there exists a vertex [Formula: see text] such that [Formula: see text], and the distance-[Formula: see text] location number, [Formula: see text], of [Formula: see text] is the minimum cardinality among all distance-[Formula: see text] locating sets of [Formula: see text]. A set [Formula: see text] is a distance-[Formula: see text] dominating set of [Formula: see text] if, for each vertex [Formula: see text], there exists a vertex [Formula: see text] such that [Formula: see text], and the distance-[Formula: see text] domination number, [Formula: see text], of [Formula: see text] is the minimum cardinality among all distance-[Formula: see text] dominating sets of [Formula: see text]. The [Formula: see text]-location-domination number of [Formula: see text], denoted by [Formula: see text], is the minimum cardinality among all sets [Formula: see text] such that [Formula: see text] is both a distance-[Formula: see text] locating set and a distance-[Formula: see text] dominating set of [Formula: see text]. For any connected graph [Formula: see text] of order at least two, we show that [Formula: see text], where [Formula: see text]. We characterize connected graphs [Formula: see text] satisfying [Formula: see text] equals [Formula: see text] and [Formula: see text], respectively. We examine the relationship among [Formula: see text], [Formula: see text] and [Formula: see text]; along the way, we show that [Formula: see text] if [Formula: see text]. We also show that there exist graphs [Formula: see text] and [Formula: see text] with [Formula: see text] such that [Formula: see text] can be arbitrarily large. Moreover, we examine some graph classes. <\/jats:p>","DOI":"10.1142\/s1793830923500477","type":"journal-article","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T13:34:02Z","timestamp":1683725642000},"source":"Crossref","is-referenced-by-count":0,"title":["On distance-s locating and distance-t dominating sets in graphs"],"prefix":"10.1142","volume":"16","author":[{"given":"Eunjeong","family":"Yi","sequence":"first","affiliation":[{"name":"Texas A&M University at Galveston, Galveston, Texas 77553, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,6,6]]},"reference":[{"key":"S1793830923500477BIB002","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.1281.c7f"},{"volume-title":"Graphs and Hypergraphs","year":"1973","author":"Berge C.","key":"S1793830923500477BIB003"},{"volume-title":"Theory of Graphs and its Applications","year":"1962","author":"Berge C.","key":"S1793830923500477BIB004"},{"key":"S1793830923500477BIB005","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025745406160"},{"key":"S1793830923500477BIB006","doi-asserted-by":"publisher","DOI":"10.1137\/050641867"},{"key":"S1793830923500477BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00198-0"},{"key":"S1793830923500477BIB008","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830915500482"},{"key":"S1793830923500477BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.06.004"},{"key":"S1793830923500477BIB010","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070305"},{"issue":"4","key":"S1793830923500477BIB011","first-page":"433","volume":"6","author":"Eroh L.","year":"2015","journal-title":"J. Comb."},{"key":"S1793830923500477BIB012","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1600"},{"key":"S1793830923500477BIB013","doi-asserted-by":"publisher","DOI":"10.21136\/MB.2014.143937"},{"key":"S1793830923500477BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.11.002"},{"key":"S1793830923500477BIB015","first-page":"89","volume":"42","author":"Erwin D. J.","year":"2004","journal-title":"Bull. Inst. Comb. Appl."},{"key":"S1793830923500477BIB017","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxaa009"},{"key":"S1793830923500477BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830922500884"},{"key":"S1793830923500477BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.11.019"},{"key":"S1793830923500477BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.04.021"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M. R.","key":"S1793830923500477BIB021"},{"issue":"2","key":"S1793830923500477BIB022","first-page":"243","volume":"83","author":"Geneson J.","year":"2022","journal-title":"Australas. J. Combin."},{"key":"S1793830923500477BIB024","doi-asserted-by":"publisher","DOI":"10.1137\/11082574"},{"key":"S1793830923500477BIB025","first-page":"191","volume":"2","author":"Harary F.","year":"1976","journal-title":"Ars. Combin."},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S1793830923500477BIB026"},{"key":"S1793830923500477BIB027","first-page":"129","volume":"73","author":"Henning M. A.","year":"2004","journal-title":"Ars. Comb."},{"key":"S1793830923500477BIB028","doi-asserted-by":"publisher","DOI":"10.37236\/302"},{"key":"S1793830923500477BIB029","first-page":"728","volume":"274","author":"Jaegar F.","year":"1972","journal-title":"C. R. Acad. Sci. Paris, Series A"},{"key":"S1793830923500477BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.07.025"},{"key":"S1793830923500477BIB031","first-page":"21","volume":"75","author":"Javaid I.","year":"2008","journal-title":"Util. Math."},{"key":"S1793830923500477BIB032","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830918500660"},{"key":"S1793830923500477BIB033","first-page":"38","volume":"95","author":"Kang C. X.","year":"2022","journal-title":"Bull. Inst. Combin. Appl."},{"journal-title":"Discrete Math. Algorithms Appl.","year":"2023","author":"Kang C. X.","key":"S1793830923500477BIB034"},{"key":"S1793830923500477BIB035","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00106-2"},{"key":"S1793830923500477BIB036","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1975.61.225"},{"key":"S1793830923500477BIB037","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/038"},{"key":"S1793830923500477BIB038","first-page":"17","volume":"40","author":"Poisson C.","year":"2002","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830923500477BIB040","first-page":"283","volume":"71","author":"Saputro S. W.","year":"2009","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830923500477BIB041","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1030.0070"},{"key":"S1793830923500477BIB042","first-page":"217","volume":"8","author":"Shanmukha B.","year":"2002","journal-title":"Far East J. Appl. Math."},{"key":"S1793830923500477BIB043","first-page":"445","volume":"22","author":"Slater P. J.","year":"1988","journal-title":"J. Math. Phys. Sci."},{"key":"S1793830923500477BIB044","first-page":"549","volume":"14","author":"Slater P. J.","year":"1975","journal-title":"Congr. Numer."},{"key":"S1793830923500477BIB045","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500597"},{"key":"S1793830923500477BIB048","doi-asserted-by":"publisher","DOI":"10.1142\/S179383092050010X"},{"issue":"2","key":"S1793830923500477BIB049","first-page":"30","volume":"7","author":"Yi E.","year":"2012","journal-title":"Contrib. Discrete Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923500477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T07:35:34Z","timestamp":1713166534000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923500477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,6]]},"references-count":43,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["10.1142\/S1793830923500477"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923500477","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2023,6,6]]},"article-number":"2350047"}}