{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T03:43:15Z","timestamp":1677728595524},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p> In this paper, we introduce the concept of global dominating-\u03c7-coloring of a graph and the corresponding parameter namely global dominating-\u03c7-color number. Let G be a graph. Among all \u03c7-colorings of G, a coloring with the maximum number of color classes that are global dominating sets in G is called a global dominating-\u03c7-coloring of G. The number of color classes that are global dominating sets in a global dominating-\u03c7-coloring of G is defined to be the global dominating-\u03c7-color number of G, denoted by gd \u03c7(G). <\/jats:p>","DOI":"10.1142\/s179383091450044x","type":"journal-article","created":{"date-parts":[[2014,4,9]],"date-time":"2014-04-09T04:19:32Z","timestamp":1397017172000},"page":"1450044","source":"Crossref","is-referenced-by-count":2,"title":["Global dominating sets in minimum coloring"],"prefix":"10.1142","volume":"06","author":[{"given":"I.","family":"Sahul Hamid","sequence":"first","affiliation":[{"name":"Department of Mathematics, The Madura College, Madurai, India"}]},{"given":"M.","family":"Rajeswari","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Fatima College, Madurai, India"}]}],"member":"219","published-online":{"date-parts":[[2014,6,16]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.06.045"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.4067\/S0716-09172011000100006"},{"key":"rf4","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2005"},{"key":"rf5","volume-title":"Chromatic Graph Theory","author":"Chartrand G.","year":"2009"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-1012-z"},{"key":"rf7","first-page":"257","volume":"33","author":"Dunbar J. E.","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"rf8","volume-title":"Domination in Graphs: Advanced Topics","author":"Haynes T. W.","year":"1998"},{"key":"rf9","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"rf11","first-page":"2019","volume":"5","author":"John Arul Singh J.","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"rf12","first-page":"33","volume":"75","author":"Michaelraj L. B.","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091450044X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:16:10Z","timestamp":1565111770000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091450044X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,16]]},"references-count":10,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2014,6,16]]},"published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.1142\/S179383091450044X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091450044x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,16]]}}}