{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:00:03Z","timestamp":1773615603869,"version":"3.50.1"},"reference-count":21,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.3103\/s0146411625700415","type":"journal-article","created":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T19:14:56Z","timestamp":1771528496000},"page":"1144-1151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dominating Sets with Neighborhoods for Trees"],"prefix":"10.3103","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6625-1572","authenticated-orcid":false,"given":"M. A.","family":"Iordanski","sequence":"first","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2026,2,19]]},"reference":[{"key":"7901_CR1","first-page":"35","volume":"3","author":"M.A. Iordanski","year":"1996","unstructured":"Iordanski, M.A., Constructive descriptions of graphs, Diskretnyi Analiz i Issledovanie Operatsii, 1996, vol. 3, no.\u00a04, pp. 35\u201363.","journal-title":"Diskretnyi Analiz i Issledovanie Operatsii"},{"key":"7901_CR2","unstructured":"Iordanski, M.A., Konstruktivnaya teoriya grafov i ee prilozheniya (Constructive Graph Theory and Its Applications), Nizhny Novgorod: Cyrillic, 2016."},{"key":"7901_CR3","doi-asserted-by":"publisher","unstructured":"Iordanski, M.A., Constructive graph theory: Generation methods, structure and dynamic characterization of closed classes of graphs\u2014A survey, arXiv Preprint, 2020. https:\/\/doi.org\/10.48550\/arXiv.2011.10984","DOI":"10.48550\/arXiv.2011.10984"},{"key":"7901_CR4","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"O. Ore","year":"1962","unstructured":"Ore, O., Theory of Graphs, Providence, RI: American Mathematical Society, 1962."},{"key":"7901_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, New York: Freeman, 1979."},{"key":"7901_CR6","doi-asserted-by":"publisher","unstructured":"Haynes, T.W., Hedetniemi, S.T., and Henning, M., Topics in Domination in Graphs, Developments in Mathematics, vol. 64, Cham: Springer, 2020. https:\/\/doi.org\/10.1007\/978-3-030-51117-3","DOI":"10.1007\/978-3-030-51117-3"},{"key":"7901_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"A. Meir","year":"1975","unstructured":"Meir, A. and Moon, J., Relations between packing and covering numbers of a tree, Pac. J. Math., 1975, vol. 61, no. 1, pp. 225\u2013233. https:\/\/doi.org\/10.2140\/pjm.1975.61.225","journal-title":"Pac. J. Math."},{"key":"7901_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.55016\/ojs\/cdm.v12i2.62487","volume":"12","author":"R. Davila","year":"2017","unstructured":"Davila, R., Fast, C., Henning, M., and Kenter, F., Lower bounds on the distance domination number of a graph, Contrib. Discrete Math., 2017, vol. 12, no. 2, pp. 11\u201321.","journal-title":"Contrib. Discrete Math."},{"key":"7901_CR9","first-page":"181","volume":"43","author":"F. Tian","year":"2009","unstructured":"Tian, F. and Xu, J., A note on distance domination numbers of graphs, Australas. J. Combinatorics, 2009, vol.\u00a043, pp. 181\u2013190.","journal-title":"Australas. J. Combinatorics"},{"key":"7901_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10878-016-0091-z","volume":"34","author":"M.A. Henning","year":"2017","unstructured":"Henning, M.A. and Lichiardopol, N., Distance domination in graphs with given minimum and maximum degree, J. Comb. Optim., 2017, vol. 34, no. 2, pp. 545\u2013553. https:\/\/doi.org\/10.1007\/s10878-016-0091-z","journal-title":"J. Comb. Optim."},{"key":"7901_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/jgt.22503","volume":"94","author":"P. Dankelmann","year":"2020","unstructured":"Dankelmann, P. and Erwin, D.J., Distance domination and generalized eccentricity in graphs with given minimum degree, J. Graph Theory, 2020, vol. 94, no. 1, pp. 5\u201319. https:\/\/doi.org\/10.1002\/jgt.22503","journal-title":"J. Graph Theory"},{"key":"7901_CR12","first-page":"235","volume":"56","author":"J. Cyman","year":"2006","unstructured":"Cyman, J., Lemanska, M., and Raczek, J., Lower bound on the distance k-domination number of a tree, Math. Slovaca, 2006, vol. 56, no. 2, pp. 235\u2013243.","journal-title":"Math. Slovaca"},{"key":"7901_CR13","first-page":"141","volume":"55","author":"A. Klobucar","year":"2005","unstructured":"Klobucar, A., On the k-dominating number of Cartesian products of two paths, Math. Slovaca, 2005, vol. 55, no. 2, pp. 141\u2013154.","journal-title":"Math. Slovaca"},{"key":"7901_CR14","doi-asserted-by":"crossref","unstructured":"Fata, E., Smith, S., and Sundaram, S., Distributed dominating sets on grids, Proceedings of the American Control Conference, 2013, pp. 211\u2013216.","DOI":"10.1109\/ACC.2013.6579839"},{"key":"7901_CR15","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"34","author":"C.E. Leiserson","year":"1985","unstructured":"Leiserson, C.E., Fat-trees: Universal networks for hardware-efficient supercomputing, IEEE Trans. Comput., 1985, vol. 34, no. 10, pp. 892\u2013901. https:\/\/doi.org\/10.1109\/TC.1985.6312192","journal-title":"IEEE Trans. Comput."},{"key":"7901_CR16","first-page":"141","volume":"14","author":"A.M. Rappoport","year":"2005","unstructured":"Rappoport, A.M., Metric characteristics of communication network graphs, Trudy Instituta Sistemnogo Analiza Rossiiskoi Akademii Nauk, 2005, vol. 14, pp. 141\u2013147.","journal-title":"Trudy Instituta Sistemnogo Analiza Rossiiskoi Akademii Nauk"},{"key":"7901_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.15863\/tas.2016.11.43.30","volume":"43","author":"V.A. Melent\u2019ev","year":"2016","unstructured":"Melent\u2019ev, V.A. and Shubin, V.I., On scalability of computing systems with compact topology, Theoretical & Applied Science, 2016, vol. 43, no. 11, pp. 164\u2013169. https:\/\/doi.org\/10.15863\/tas.2016.11.43.30","journal-title":"Theoretical & Applied Science"},{"key":"7901_CR18","unstructured":"Iordanski, M.A., Cloning of graphs, XVIII Mezhdunarodnaya konferentsiya Problemy teoreticheskoi kibernetiki (Proceedings of the XVIII International Conference on Problems of Theoretical Cybernetics), Penza, 2017, Moscow: MAKS Press, 2017, pp. 108\u2013110."},{"key":"7901_CR19","unstructured":"Iordanski, M.A., On the complexity of graph synthesis using cloning operations, Materialy XIII Mezhdunarodnogo seminara Diskretnaya matematika i ee prilozheniya im. Akademika O.B. Lupanova (Proceedings of the XIII\u00a0International Seminar on Discrete Mathematics and Its Applications Dedicated to Academician O.B. Lupanov), Moscow, 2019, Moscow: Izdatel\u2019stvo Mekhaniko-Matematicheskogo Fakul\u2019teta, Moskovskii Gosudarstvennyi Universitet, 2019, pp. 220\u2013223."},{"key":"7901_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1515\/dma-2024-0017","volume":"34","author":"M.A. Iordanski","year":"2022","unstructured":"Iordanski, M.A., Cloning operations and graph diameter, Diskretnaya Matematika, 2022, vol. 34, no. 2, pp. 26\u201331. https:\/\/doi.org\/10.1515\/dma-2024-0017","journal-title":"Diskretnaya Matematika"},{"key":"7901_CR21","doi-asserted-by":"publisher","first-page":"46","DOI":"10.4213\/dm1770","volume":"35","author":"M.A. Iordanski","year":"2023","unstructured":"Iordanski, M.A., Scaling graphs with diameter constraint, Diskretnaya Matematika, 2023, vol. 35, no. 4, pp. 46\u201357. https:\/\/doi.org\/10.4213\/dm1770","journal-title":"Diskretnaya Matematika"}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411625700415.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411625700415","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411625700415.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:02:07Z","timestamp":1773612127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411625700415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["7901"],"URL":"https:\/\/doi.org\/10.3103\/s0146411625700415","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"18 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author of this work declares that he has no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}