{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T16:09:07Z","timestamp":1787242147898,"version":"build-2736575974"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T00:00:00Z","timestamp":1705622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T00:00:00Z","timestamp":1705622400000},"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":["Soft Comput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00500-023-09568-w","type":"journal-article","created":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T12:02:18Z","timestamp":1705665738000},"page":"7003-7011","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dominated coloring in certain networks"],"prefix":"10.1007","volume":"28","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":[[2024,1,19]]},"reference":[{"key":"9568_CR1","doi-asserted-by":"crossref","unstructured":"Appel KI, Haken W (1989) Every planar map is four colorable, vol 98. American Mathematical Soc","DOI":"10.1090\/conm\/098"},{"key":"9568_CR2","doi-asserted-by":"publisher","first-page":"1728","DOI":"10.1007\/s10910-016-0646-3","volume":"54","author":"M Arockiaraj","year":"2016","unstructured":"Arockiaraj M, Kavitha SRJ, Balasubramanian K (2016) Vertex cut method for degree and distance-based topological indices and its applications to silicate networks. J Math Chem 54:1728\u20131747. https:\/\/doi.org\/10.1007\/s10910-016-0646-3","journal-title":"J Math Chem"},{"key":"9568_CR3","doi-asserted-by":"publisher","unstructured":"Arumugam S, Chandrasekar KR, Misra N, Philip G, Saurabh S (2011) Algorithmic aspects of dominator colorings in graphs. In: Combinatorial algorithms: 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, 20\u201322 July 2011, Revised Selected Papers 22, pp. 19\u201330. Springer. https:\/\/doi.org\/10.1007\/978-3-642-25011-8_2","DOI":"10.1007\/978-3-642-25011-8_2"},{"issue":"3","key":"9568_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.dam.2012.08.023","volume":"161","author":"CN Campos","year":"2013","unstructured":"Campos CN, Wakabayashi Y (2013) On dominating sets of maximal outerplanar graphs. Discrete Appl Math 161(3):330\u2013335. https:\/\/doi.org\/10.1016\/j.dam.2012.08.023","journal-title":"Discrete Appl Math"},{"key":"9568_CR5","unstructured":"Chelvam TT (2009) Total and connected domination in circulant graphs. In: India-Taiwan conference on discrete mathematics, p 22"},{"key":"9568_CR6","doi-asserted-by":"crossref","unstructured":"Chen YH (2014) The dominated coloring problem and its application. In: International conference on computational science and its applications. Springer, pp 132\u2013145","DOI":"10.1007\/978-3-319-09153-2_10"},{"issue":"8","key":"9568_CR7","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1080\/09720529.2021.1885807","volume":"25","author":"Q Chen","year":"2022","unstructured":"Chen Q (2022) Dominator and total dominator coloring of circulant graph $${C}_{n}^{}(1,2)$$. J Discrete Math Sci Cryptogr 25(8):2549\u20132567. https:\/\/doi.org\/10.1080\/09720529.2021.1885807","journal-title":"J Discrete Math Sci Cryptogr"},{"key":"9568_CR8","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":"9568_CR9","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 D.A. (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":"9568_CR10","doi-asserted-by":"crossref","unstructured":"Gera R (2007) On dominator colorings in graphs. In: Graph theory notes of New York, vol 52, pp 25\u201330","DOI":"10.1109\/ITNG.2007.142"},{"key":"9568_CR11","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 Dekker Publications, New York"},{"key":"9568_CR12","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York"},{"issue":"9","key":"9568_CR13","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.disc.2011.08.019","volume":"312","author":"AM Hinz","year":"2012","unstructured":"Hinz AM, Parisse D (2012) Coloring Hanoi and Sierpi\u0144ski graphs. Discrete Math 312(9):1521\u20131535. https:\/\/doi.org\/10.1016\/j.disc.2011.08.019","journal-title":"Discrete Math"},{"key":"9568_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.dam.2016.09.024","volume":"217","author":"AM Hinz","year":"2017","unstructured":"Hinz AM, Klav\u017ear S, Zemlji\u010d SS (2017) A survey and classification of Sierpi\u0144ski-type graphs. Discrete Appl Math 217:565\u2013600. https:\/\/doi.org\/10.1016\/j.dam.2016.09.024","journal-title":"Discrete Appl Math"},{"issue":"1\u20133","key":"9568_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(01)00341-3","volume":"299","author":"FK Hwang","year":"2003","unstructured":"Hwang FK (2003) A survey on multi-loop networks. Theor Comput Sci 299(1\u20133):107\u2013121. https:\/\/doi.org\/10.1016\/S0304-3975(01)00341-3","journal-title":"Theor Comput Sci"},{"issue":"17\u201318","key":"9568_CR16","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.1016\/j.disc.2010.03.022","volume":"310","author":"EL King","year":"2010","unstructured":"King EL, Pelsmajer MJ (2010) Dominating sets in plane triangulations. Discrete Math 310(17\u201318):2221\u20132230. https:\/\/doi.org\/10.1016\/j.disc.2010.03.022","journal-title":"Discrete Math"},{"issue":"15","key":"9568_CR17","doi-asserted-by":"publisher","first-page":"6989","DOI":"10.1007\/s00500-022-07217-2","volume":"26","author":"N K\u0131rcal\u0131 G\u00fcrsoy","year":"2022","unstructured":"K\u0131rcal\u0131 G\u00fcrsoy N, \u00dclker A, G\u00fcrsoy A (2022) Independent domination polynomial of zero-divisor graphs of commutative rings. Soft Comput 26(15):6989\u20136997. https:\/\/doi.org\/10.1007\/s00500-022-07217-2","journal-title":"Soft Comput"},{"key":"9568_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022444205860","volume":"47","author":"S Klav\u017ear","year":"1997","unstructured":"Klav\u017ear S, Milutinovi\u0107 U (1997) Graphs $${S}(n, k)$$ and a variant of the Tower of Hanoi problem. Czechoslov Math J 47:95\u2013104. https:\/\/doi.org\/10.1023\/A:1022444205860","journal-title":"Czechoslov Math J"},{"key":"9568_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":"3","key":"9568_CR20","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S0004972700040235","volume":"66","author":"S Klav\u017ear","year":"2002","unstructured":"Klav\u017ear S, Milutinovi\u0107 U, Petr C (2002) 1-perfect codes in Sierpi\u0144ski graphs. Bull Aust Math Soc 66(3):369\u2013384. https:\/\/doi.org\/10.1017\/S0004972700040235","journal-title":"Bull Aust Math Soc"},{"issue":"2","key":"9568_CR21","first-page":"99","volume":"8","author":"V Kulli","year":"2017","unstructured":"Kulli V (2017) Computation of some topological indices of certain networks. Int J Math Arch 8(2):99\u2013106","journal-title":"Int J Math Arch"},{"issue":"13","key":"9568_CR22","doi-asserted-by":"publisher","first-page":"2065","DOI":"10.1049\/iet-cta.2016.1237","volume":"11","author":"J-B Liu","year":"2017","unstructured":"Liu J-B, Wang S, Wang C, Hayat S (2017) Further results on computation of topological indices of certain networks. IET Control Theory Appl 11(13):2065\u20132071. https:\/\/doi.org\/10.1049\/iet-cta.2016.1237","journal-title":"IET Control Theory Appl"},{"issue":"3","key":"9568_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<213::AID-JGT2>3.0.CO;2-P","volume":"22","author":"G MacGillivray","year":"1996","unstructured":"MacGillivray G, Seyffarth K (1996) Domination numbers of planar graphs. J Graph Theory 22(3):213\u2013229","journal-title":"J Graph Theory"},{"issue":"1","key":"9568_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E Malaguti","year":"2010","unstructured":"Malaguti E, Toth P (2010) A survey on vertex coloring problems. Int Trans Oper Res 17(1):1\u201334. https:\/\/doi.org\/10.1111\/j.1475-3995.2009.00696.x","journal-title":"Int Trans Oper Res"},{"key":"9568_CR25","doi-asserted-by":"publisher","unstructured":"Manuel P, Rajasingh I (2009) Topological properties of silicate networks. In: 2009 5th IEEE GCC conference & exhibition. IEEE, pp 1\u20135. https:\/\/doi.org\/10.1109\/IEEEGCC.2009.5734286","DOI":"10.1109\/IEEEGCC.2009.5734286"},{"issue":"4","key":"9568_CR26","doi-asserted-by":"publisher","first-page":"677","DOI":"10.7151\/dmgt.1635","volume":"32","author":"H Merouane","year":"2012","unstructured":"Merouane H, Chellali M (2012) On the dominator colorings in trees. Discussiones Mathematicae Graph Theory 32(4):677\u2013683. https:\/\/doi.org\/10.7151\/dmgt.1635","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"9568_CR27","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"},{"issue":"6","key":"9568_CR28","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ipl.2007.02.004","volume":"102","author":"N Obradovi\u0107","year":"2007","unstructured":"Obradovi\u0107 N, Peters J, Ru\u017ei\u0107 G (2007) Efficient domination in circulant graphs with two chord lengths. Inf Process Lett 102(6):253\u2013258. https:\/\/doi.org\/10.1016\/j.ipl.2007.02.004","journal-title":"Inf Process Lett"},{"key":"9568_CR29","first-page":"145","volume":"90","author":"D Parisse","year":"2009","unstructured":"Parisse D (2009) Sierpi\u0144ski graphs $${S}(n, k)$$. ARS Combin 90:145\u2013160","journal-title":"ARS Combin"},{"key":"9568_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-023-08752-2","author":"S Prajnanaswaroopa","year":"2023","unstructured":"Prajnanaswaroopa S, Geetha J, Somasundaram K (2023) Total chromatic number for some classes of Cayley graphs. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-023-08752-2","journal-title":"Soft Comput"},{"key":"9568_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/1100024","volume":"2021","author":"R Qi","year":"2021","unstructured":"Qi R, Ali H, Babar U, Liu J-B, Ali P (2021) On the sum of degree-based topological indices of rhombus-type silicate and oxide structures. J Math 2021:1\u201316. https:\/\/doi.org\/10.1155\/2021\/1100024","journal-title":"J Math"},{"key":"9568_CR32","doi-asserted-by":"publisher","unstructured":"Robertson N, Sanders D, Seymour P, Thomas R (1997) The four-colour theorem. J Combin Theory Ser B 70(1):2\u201344. https:\/\/doi.org\/10.1006\/jctb.1997.1750","DOI":"10.1006\/jctb.1997.1750"},{"issue":"1","key":"9568_CR33","first-page":"1","volume":"34","author":"H Wang","year":"2011","unstructured":"Wang H, Xu X, Yang Y, Wang G, L\u00fc K (2011) On the distance paired-domination of circulant graphs. Bull Malays Math Sci Soc Sec Ser 34(1):1\u201319","journal-title":"Bull Malays Math Sci Soc Sec Ser"},{"key":"9568_CR34","unstructured":"Xu J (2013) Topological structure and analysis of interconnection networks, vol 7. Springer, New York"},{"issue":"3","key":"9568_CR35","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s00373-013-1289-9","volume":"30","author":"B Xue","year":"2014","unstructured":"Xue B, Zuo L, Wang G, Li G (2014) The linear $$t$$-colorings of Sierpi\u0144ski-like graphs. Graphs Combin 30(3):755\u2013767. https:\/\/doi.org\/10.1007\/s00373-013-1289-9","journal-title":"Graphs Combin"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09568-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-09568-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09568-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T09:05:10Z","timestamp":1721379910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-09568-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,19]]},"references-count":35,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9568"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-09568-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,19]]},"assertion":[{"value":"7 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2024","order":2,"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 that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}