{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T06:47:54Z","timestamp":1775371674348,"version":"3.50.1"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12161141006"],"award-info":[{"award-number":["12161141006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin","doi-asserted-by":"crossref","award":["20JCJQJC00090"],"award-info":[{"award-number":["20JCJQJC00090"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin","doi-asserted-by":"crossref","award":["20JCZDJC00840"],"award-info":[{"award-number":["20JCZDJC00840"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:p> Let [Formula: see text] be a graph and let [Formula: see text] be an integer. A vertex subset [Formula: see text] is called a [Formula: see text]-extended dominating set if every vertex [Formula: see text] of [Formula: see text] satisfies one of the following conditions: the distance between [Formula: see text] and [Formula: see text] is at most one or there are at least [Formula: see text] different vertices [Formula: see text] such that the distance between [Formula: see text] and [Formula: see text] ([Formula: see text]) is two. The [Formula: see text]-extended domination number [Formula: see text] of [Formula: see text] is the minimum size over all [Formula: see text]-extended dominating sets in [Formula: see text]. When [Formula: see text], they are called the extended dominating set and the extended domination number of [Formula: see text], respectively. In this paper, we mainly study the bounds of the extended domination numbers of graphs. First, we obtain the exact values of the extended domination numbers for paths and cycles. And then the Nordhaus\u2013Gaddum bounds for the extended domination numbers are provided. Additionally, we give some bounds of the extended domination numbers for planar graphs with small diameters. Finally, we consider the [Formula: see text]-extended domination numbers in Random graphs. <\/jats:p>","DOI":"10.1142\/s0217595923400158","type":"journal-article","created":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T03:14:57Z","timestamp":1685934897000},"source":"Crossref","is-referenced-by-count":1,"title":["The Extended Dominating Sets in Graphs"],"prefix":"10.1142","volume":"40","author":[{"given":"Zhipeng","family":"Gao","sequence":"first","affiliation":[{"name":"Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[{"name":"Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changqing","family":"Xi","sequence":"additional","affiliation":[{"name":"Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yue","sequence":"additional","affiliation":[{"name":"School of Mathematics Science, Tiangong University, Tianjin 300387, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"key":"S0217595923400158BIB001","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.dam.2017.10.020","volume":"236","author":"Araki T","year":"2018","journal-title":"Discrete Applied Mathematics"},{"key":"S0217595923400158BIB002","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.dam.2020.01.005","volume":"283","author":"Borg P","year":"2020","journal-title":"Discrete Applied Mathematics"},{"key":"S0217595923400158BIB003","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B  (1998).  Modern Graph Theory.  Springer,  New York,  215\u2013252.","DOI":"10.1007\/978-1-4612-0619-4_7"},{"key":"S0217595923400158BIB004","doi-asserted-by":"crossref","first-page":"763","DOI":"10.7151\/dmgt.2339","volume":"41","author":"Bujt\u00e1s C","year":"2021","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"1","key":"S0217595923400158BIB005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556788.2019.1679142","volume":"37","author":"Cai Q","year":"2022","journal-title":"Optimization Methods and Software"},{"key":"S0217595923400158BIB006","volume-title":"Graphs and Digraphs","author":"Chartrand G","year":"1996","edition":"3"},{"key":"S0217595923400158BIB007","first-page":"97","volume":"67","author":"Dunbar JE","year":"2005","journal-title":"Utilitas Mathematica"},{"key":"S0217595923400158BIB008","doi-asserted-by":"crossref","first-page":"103508","DOI":"10.1016\/j.ejc.2022.103508","volume":"102","author":"Deshpande P","year":"2022","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"S0217595923400158BIB009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.10027","volume":"40","author":"Goddard WD","year":"2002","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"S0217595923400158BIB010","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(94)00373-Q","volume":"155","author":"Harary F","year":"1996","journal-title":"Discrete Mathematics"},{"key":"S0217595923400158BIB011","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-51117-3","volume-title":"Topics in Domination in Graphs","author":"Haynes TW","year":"2020"},{"key":"S0217595923400158BIB012","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-58892-2","volume-title":"Structures of Domination in Graphs","author":"Haynes TW","year":"2021"},{"key":"S0217595923400158BIB013","volume-title":"Domination in Graphs: Advanced Topics","author":"Haynes TW","year":"1998"},{"key":"S0217595923400158BIB014","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes TW","year":"1998"},{"key":"S0217595923400158BIB015","series-title":"Developments in Mathematics","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-030-51117-3_7","volume-title":"Topics in Domination in Graphs","volume":"64","author":"Henning MA","year":"2020"},{"issue":"2","key":"S0217595923400158BIB016","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10878-016-0091-z","volume":"34","author":"Henning MA","year":"2017","journal-title":"Journal of Combinatorial Optimization"},{"key":"S0217595923400158BIB017","first-page":"728","volume":"274","author":"Jaeger F","year":"1972","journal-title":"Comptes Rendus de l\u2019Acad\u00e9emie des Sciences-Series A"},{"key":"S0217595923400158BIB018","first-page":"41","volume-title":"Proc. Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201992)","author":"Joel S","year":"1992"},{"key":"S0217595923400158BIB019","first-page":"177","volume":"11","author":"Joseph JP","year":"1995","journal-title":"International Journal of Agile Management Systems"},{"key":"S0217595923400158BIB020","doi-asserted-by":"crossref","first-page":"947","DOI":"10.7151\/dmgt.2053","volume":"38","author":"Li H","year":"2018","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"3","key":"S0217595923400158BIB021","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<213::AID-JGT2>3.0.CO;2-P","volume":"22","author":"MacGillivray G","year":"1996","journal-title":"Journal of Graph Theory"},{"key":"S0217595923400158BIB022","doi-asserted-by":"crossref","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"Meir A","year":"1975","journal-title":"Pacific Journal of Mathematics"},{"key":"S0217595923400158BIB023","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"Nordhaus EA","year":"1956","journal-title":"American Mathematical Monthly"},{"key":"S0217595923400158BIB024","series-title":"American Mathematical Society Colloquium Publications","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","volume":"38","author":"Ore O","year":"1962"},{"issue":"3","key":"S0217595923400158BIB025","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1017\/S0963548300002042","volume":"5","author":"Reed B","year":"1996","journal-title":"Combinatorics, Probability and Computing"},{"key":"S0217595923400158BIB026","doi-asserted-by":"crossref","first-page":"759","DOI":"10.4134\/JKMS.2009.46.4.759","volume":"46","author":"Sohn MY","year":"2009","journal-title":"Journal of the Korean Mathematical Society"},{"issue":"9","key":"S0217595923400158BIB027","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/TPDS.2002.1036062","volume":"13","author":"Wu J","year":"2002","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"8","key":"S0217595923400158BIB028","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1109\/TPDS.2006.103","volume":"17","author":"Wu J","year":"2006","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"5","key":"S0217595923400158BIB029","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00373-010-0992-z","volume":"27","author":"Zverovich VE","year":"2011","journal-title":"Graphs and Combinatorics"},{"key":"S0217595923400158BIB030","doi-asserted-by":"crossref","first-page":"2679","DOI":"10.1007\/s00373-021-02383-w","volume":"37","author":"Zhuang W","year":"2021","journal-title":"Graphs and Combinatorics"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595923400158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T07:59:01Z","timestamp":1696406341000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0217595923400158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,17]]},"references-count":30,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10.1142\/S0217595923400158"],"URL":"https:\/\/doi.org\/10.1142\/s0217595923400158","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,17]]},"article-number":"2340015"}}