{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:12:56Z","timestamp":1762272776986,"version":"3.41.2"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"name":"UGC SAP","award":["NO.F.510\/12\/DRS-II\/2018(SAP-I)"],"award-info":[{"award-number":["NO.F.510\/12\/DRS-II\/2018(SAP-I)"]}]},{"name":"UGC JRF","award":["DEC18-400241"],"award-info":[{"award-number":["DEC18-400241"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p> Global dominator coloring of the graph [Formula: see text] is the proper coloring of [Formula: see text] such that every vertex of [Formula: see text] dominates atleast one color class as well as anti-dominates atleast one color class. The minimum number of colors required for global dominator coloring of [Formula: see text] is called global dominator chromatic number of [Formula: see text] denoted by [Formula: see text]. In this paper, we characterize trees [Formula: see text] of order [Formula: see text] [Formula: see text] such that [Formula: see text] and also establish a strict upper bound for [Formula: see text] for a tree of even order [Formula: see text] [Formula: see text]. We construct some family of graphs [Formula: see text] with [Formula: see text] and prove some results on [Formula: see text]-partitions of [Formula: see text] when [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830921501585","type":"journal-article","created":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T08:55:23Z","timestamp":1626944123000},"source":"Crossref","is-referenced-by-count":2,"title":["A note on global dominator coloring of graphs"],"prefix":"10.1142","volume":"14","author":[{"given":"R.","family":"Rangarajan","sequence":"first","affiliation":[{"name":"Department of Studies in Mathematics, University of Mysore, Manasagangothri, Mysuru 570006, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9182-7449","authenticated-orcid":false,"given":"David. A.","family":"Kalarkop","sequence":"additional","affiliation":[{"name":"Department of Studies in Mathematics, University of Mysore, Manasagangothri, Mysuru 570006, India"}]}],"member":"219","published-online":{"date-parts":[[2021,7,21]]},"reference":[{"key":"S1793830921501585BIB001","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2011","edition":"4"},{"doi-asserted-by":"publisher","key":"S1793830921501585BIB002","DOI":"10.1007\/s00373-010-1012-z"},{"doi-asserted-by":"publisher","key":"S1793830921501585BIB003","DOI":"10.1016\/j.tcs.2020.06.009"},{"key":"S1793830921501585BIB004","first-page":"25","volume":"52","author":"Gera R.","year":"2007","journal-title":"Graph Theory Notes"},{"key":"S1793830921501585BIB005","first-page":"19","volume":"181","author":"Gera R.","year":"2006","journal-title":"Congr. Numer."},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S1793830921501585BIB006"},{"volume-title":"Domination in Graphs-Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S1793830921501585BIB007"},{"doi-asserted-by":"publisher","key":"S1793830921501585BIB008","DOI":"10.7151\/dmgt.2208"},{"doi-asserted-by":"publisher","key":"S1793830921501585BIB009","DOI":"10.7151\/dmgt.2089"},{"doi-asserted-by":"publisher","key":"S1793830921501585BIB010","DOI":"10.1016\/j.tcs.2019.05.032"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921501585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T04:51:45Z","timestamp":1659415905000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830921501585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":10,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1142\/S1793830921501585"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921501585","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,7,21]]},"article-number":"2150158"}}