{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T13:19:49Z","timestamp":1783948789584,"version":"3.55.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T00:00:00Z","timestamp":1745884800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T00:00:00Z","timestamp":1745884800000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s40314-025-03207-w","type":"journal-article","created":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T06:48:10Z","timestamp":1745909290000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dominated coloring in certain trees"],"prefix":"10.1007","volume":"44","author":[{"given":"S.","family":"Poonkuzhali","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7878-1578","authenticated-orcid":false,"given":"R.","family":"Jayagopal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,29]]},"reference":[{"issue":"1","key":"3207_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s40314-022-02156-y","volume":"42","author":"M Anholcer","year":"2023","unstructured":"Anholcer M, Cichacz S, Peterin I (2023) On b-acyclic chromatic number of a graph. Comput Appl Math 42(1):21. https:\/\/doi.org\/10.1007\/s40314-022-02156-y","journal-title":"Comput Appl Math"},{"issue":"6","key":"3207_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s40314-023-02386-8","volume":"42","author":"M Arshad","year":"2023","unstructured":"Arshad M, Hayat S, Jamil H (2023) The domination number of the king\u2019s graph. Comput Appl Math 42(6):251. https:\/\/doi.org\/10.1007\/s40314-023-02386-8","journal-title":"Comput Appl Math"},{"issue":"1","key":"3207_CR3","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00500-019-04278-8","volume":"24","author":"A Bandyopadhyay","year":"2020","unstructured":"Bandyopadhyay A, Dhar AK, Basu S (2020) Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks. Soft Comput 24(1):603\u2013625. https:\/\/doi.org\/10.1007\/s00500-019-04278-8","journal-title":"Soft Comput"},{"key":"3207_CR4","unstructured":"Beecroft J, Addison D, Petrini F, McLaren M (2003) QsNet-II: an interconnect for supercomputing applications. In: The proceedings of hot chips\u2019 03, Stanford University, California, USA"},{"key":"3207_CR5","volume-title":"The theory of graphs and its applications","author":"C Berge","year":"1962","unstructured":"Berge C (1962) The theory of graphs and its applications. Methuen, London"},{"key":"3207_CR6","doi-asserted-by":"crossref","unstructured":"Bozkus Z, Ranka S, Fox G (1992) Modeling the CM-5 multicomputer. In: The 4th symposium on the frontiers of massively computation, McLean, Virginia, USA, pp 100\u2013107","DOI":"10.1109\/FMPC.1992.234900"},{"issue":"1\u20133","key":"3207_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(97)00125-X","volume":"82","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt A, Chepoi VD, Dragan FF (1998) The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discret Appl Math 82(1\u20133):43\u201377. https:\/\/doi.org\/10.1016\/S0166-218X(97)00125-X","journal-title":"Discret Appl Math"},{"key":"3207_CR8","doi-asserted-by":"publisher","unstructured":"Chen YH (2014) The dominated coloring problem and its application. In: International conference on computational science and its applications. Springer, Berlin, pp 132\u2013145. https:\/\/doi.org\/10.1007\/978-3-319-09153-2_10","DOI":"10.1007\/978-3-319-09153-2_10"},{"key":"3207_CR9","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00500-017-2861-7","volume":"23","author":"L Chen","year":"2019","unstructured":"Chen L, Peng J, Ralescu DA (2019) Uncertain vertex coloring problem. Soft Comput 23:1337\u20131346. https:\/\/doi.org\/10.1007\/s00500-017-2861-7","journal-title":"Soft Comput"},{"issue":"5","key":"3207_CR10","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.3906\/mat-1710-97","volume":"42","author":"F Choopani","year":"2018","unstructured":"Choopani F, Jafarzadeh A, Erfanian A, Mojdeh DA (2018) On dominated coloring of graphs and some Nordhaus\u2013Gaddum-type relations. Turk J Math 42(5):2148\u20132156. https:\/\/doi.org\/10.3906\/mat-1710-97","journal-title":"Turk J Math"},{"key":"3207_CR11","first-page":"25","volume":"52","author":"R Gera","year":"2007","unstructured":"Gera R (2007) On dominator colorings in graphs. Graph Theory Notes N Y 52:25\u201330","journal-title":"Graph Theory Notes N Y"},{"issue":"4","key":"3207_CR12","doi-asserted-by":"publisher","first-page":"2637","DOI":"10.1007\/s00500-019-03811-z","volume":"24","author":"A Ghaffari-Hadigheh","year":"2020","unstructured":"Ghaffari-Hadigheh A (2020) Roman domination problem with uncertain positioning and deployment costs. Soft Comput 24(4):2637\u20132645. https:\/\/doi.org\/10.1007\/s00500-019-03811-z","journal-title":"Soft Comput"},{"issue":"12","key":"3207_CR13","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1109\/TC.1981.1675731","volume":"30","author":"J Goodman","year":"1981","unstructured":"Goodman J, Sequin C (1981) Hypertree: a multiprocessor interconnection topology. IEEE Trans Comput 30(12):923\u2013933. https:\/\/doi.org\/10.1109\/TC.1981.1675731","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"3207_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/s40314-024-02738-y","volume":"43","author":"K Hamidizadeh","year":"2024","unstructured":"Hamidizadeh K, Manaviyat R, Mirvakili S, Davvaz B (2024) Application of soft sets to graph coloring. Comput Appl Math 43(4):214. https:\/\/doi.org\/10.1007\/s40314-024-02738-y","journal-title":"Comput Appl Math"},{"key":"3207_CR15","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1007\/s00500-018-3206-x","volume":"23","author":"G-S Hao","year":"2019","unstructured":"Hao G-S, Lim M-H, Ong Y-S, Huang H, Wang G-G (2019) Domination landscape in evolutionary algorithms and its applications. Soft Comput 23:3563\u20133570. https:\/\/doi.org\/10.1007\/s00500-018-3206-x","journal-title":"Soft Comput"},{"key":"3207_CR16","volume-title":"Domination in graphs: advanced topics","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Domination in graphs: advanced topics. Marcel Decker, New York"},{"issue":"1\u20132","key":"3207_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0020-0190(99)00122-2","volume":"72","author":"C-N Hung","year":"1999","unstructured":"Hung C-N, Hsu L-H, Sung T-Y (1999) Christmas tree: a versatile 1-fault-tolerant design for token rings. Inf Process Lett 72(1\u20132):55\u201363. https:\/\/doi.org\/10.1016\/S0020-0190(99)00122-2","journal-title":"Inf Process Lett"},{"issue":"2","key":"3207_CR18","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.20206","volume":"51","author":"M Johnson","year":"2008","unstructured":"Johnson M et al (2008) Transversals of subtree hypergraphs and the source location problem in digraphs. Networks 51(2):113\u2013119. https:\/\/doi.org\/10.1002\/net.20206","journal-title":"Networks"},{"key":"3207_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125647","volume":"390","author":"S Klav\u017ear","year":"2021","unstructured":"Klav\u017ear S, Tavakoli M (2021) Dominated and dominator colorings over (edge) corona and hierarchical products. Appl Math Comput 390:125647. https:\/\/doi.org\/10.1016\/j.amc.2020.125647","journal-title":"Appl Math Comput"},{"issue":"10","key":"3207_CR20","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"100","author":"CE Leiserson","year":"1985","unstructured":"Leiserson CE (1985) Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans Comput 100(10):892\u2013901. https:\/\/doi.org\/10.1109\/TC.1985.6312192","journal-title":"IEEE Trans Comput"},{"key":"3207_CR21","doi-asserted-by":"publisher","unstructured":"Leiserson CE, Abuhamdeh ZS, Douglas DC, Feynman CR, Ganmukhi MN, Hill JV, Hillis D, Kuszmaul BC, St.\u00a0Pierre MA, Wells DS, Wong MC, Yang SW, Zak R (1992) The network architecture of the connection machine CM-5. In: Proceedings of the fourth annual ACM symposium on parallel algorithms and architectures, pp 272\u2013285. https:\/\/doi.org\/10.1145\/140901.141883","DOI":"10.1145\/140901.141883"},{"issue":"4","key":"3207_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s10878-023-01094-7","volume":"46","author":"M Li","year":"2023","unstructured":"Li M, Zhang S, Ye C (2023) Dominated coloring in product graphs. J Comb Optim 46(4):24. https:\/\/doi.org\/10.1007\/s10878-023-01094-7","journal-title":"J Comb Optim"},{"key":"3207_CR23","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s40314-013-0077-8","volume":"33","author":"J Liu","year":"2014","unstructured":"Liu J, Zhang X (2014) The exact domination number of generalized Petersen graphs $${P}(n, k)$$ with $$n=2k$$ and $$n=2k+2^{*}$$. Comput Appl Math 33:497\u2013506. https:\/\/doi.org\/10.1007\/s40314-013-0077-8","journal-title":"Comput Appl Math"},{"issue":"8","key":"3207_CR24","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/s40314-022-02137-1","volume":"41","author":"JA Mart\u00ednez","year":"2022","unstructured":"Mart\u00ednez JA, Casta\u00f1o-Fern\u00e1ndez AB, Puertas ML (2022) The 2-domination number of cylindrical graphs. Comput Appl Math 41(8):424. https:\/\/doi.org\/10.1007\/s40314-022-02137-1","journal-title":"Comput Appl Math"},{"key":"3207_CR25","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s00373-014-1407-3","volume":"31","author":"HB Merouane","year":"2015","unstructured":"Merouane HB, Haddad M, Chellali M, Kheddouci H (2015) Dominated colorings of graphs. Graphs Comb 31:713\u2013727. https:\/\/doi.org\/10.1007\/s00373-014-1407-3","journal-title":"Graphs Comb"},{"key":"3207_CR26","doi-asserted-by":"publisher","unstructured":"Ohring SR, Ibel M, Das SK, Kumar MJ (1995) On generalized fat trees. In: Proceedings of 9th international parallel processing symposium. Santa Barbara, CA, USA. IEEE, pp 37\u201344. https:\/\/doi.org\/10.1109\/IPPS.1995.395911","DOI":"10.1109\/IPPS.1995.395911"},{"key":"3207_CR27","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/038","volume-title":"Theory of graphs","author":"O Ore","year":"1962","unstructured":"Ore O (1962) Theory of graphs. American Mathematical Society, Providence"},{"issue":"6","key":"3207_CR28","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/s40314-024-02901-5","volume":"43","author":"K Paul","year":"2024","unstructured":"Paul K, Pandey A (2024) Perfect Italian domination on some generalizations of cographs. Comput Appl Math 43(6):390. https:\/\/doi.org\/10.1007\/s40314-024-02901-5","journal-title":"Comput Appl Math"},{"key":"3207_CR29","doi-asserted-by":"publisher","first-page":"7003","DOI":"10.1007\/s00500-023-09568-w","volume":"28","author":"S Poonkuzhali","year":"2024","unstructured":"Poonkuzhali S, Jayagopal R (2024) Dominated coloring in certain networks. Soft Comput 28:7003\u20137011. https:\/\/doi.org\/10.1007\/s00500-023-09568-w","journal-title":"Soft Comput"},{"key":"3207_CR30","doi-asserted-by":"publisher","first-page":"15609","DOI":"10.1007\/s00500-023-08752-2","volume":"27","author":"S Prajnanaswaroopa","year":"2023","unstructured":"Prajnanaswaroopa S, Geetha J, Somasundaram K (2023) Total chromatic number for some classes of Cayley graphs. Soft Comput 27:15609\u201315617. https:\/\/doi.org\/10.1007\/s00500-023-08752-2","journal-title":"Soft Comput"},{"issue":"6","key":"3207_CR31","doi-asserted-by":"publisher","first-page":"005","DOI":"10.12732\/ijpam.v86i6.13","volume":"86","author":"RS Rajan","year":"2013","unstructured":"Rajan RS, Rajasingh I, Rajalaxmi T, Parthiban N (2013) Embedding of circulant networks into $$k$$-rooted sibling trees. Int J Pure Appl Math 86(6):005\u20131012. https:\/\/doi.org\/10.12732\/ijpam.v86i6.13","journal-title":"Int J Pure Appl Math"},{"key":"3207_CR32","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.dam.2020.01.008","volume":"280","author":"I Rajasingh","year":"2020","unstructured":"Rajasingh I, Jayagopal R, Rajan RS (2020) Domination parameters in hypertrees and sibling trees. Discret Appl Math 280:237\u2013245. https:\/\/doi.org\/10.1016\/j.dam.2020.01.008","journal-title":"Discret Appl Math"},{"key":"3207_CR33","doi-asserted-by":"publisher","unstructured":"Schauser KE, Scheiman CJ (1995) Experience with active messages on the Meiko CS-2. In: Proceedings of 9th international parallel processing symposium. Santa Barbara, CA, USA. IEEE, pp 140\u2013149. https:\/\/doi.org\/10.1109\/IPPS.1995.395925","DOI":"10.1109\/IPPS.1995.395925"},{"key":"3207_CR34","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1007\/s10878-019-00437-7","volume":"38","author":"C Song","year":"2019","unstructured":"Song C, Hao R-X (2019) Antimagic orientations for the complete $$k$$-ary trees. J Comb Optim 38:1077\u20131085. https:\/\/doi.org\/10.1007\/s10878-019-00437-7","journal-title":"J Comb Optim"},{"key":"3207_CR35","volume-title":"Topological structure and analysis of interconnection networks","author":"J Xu","year":"2013","unstructured":"Xu J (2013) Topological structure and analysis of interconnection networks. Springer, New York"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03207-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03207-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03207-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T14:11:09Z","timestamp":1747663869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03207-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,29]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["3207"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03207-w","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,29]]},"assertion":[{"value":"19 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}],"article-number":"253"}}