{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:30:30Z","timestamp":1648524630787},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,4]]},"abstract":"<jats:p> This paper introduces a new domination parameter called coefficient of domination of a graph, which measures the maximum possible efficiency of domination for the given graph. It is evaluated for various classes of graphs and different bounds are proposed. Finally, Nordhaus\u2013Gaddum type inequalities are established for coefficient of domination of a graph and its complement. <\/jats:p>","DOI":"10.1142\/s1793830917500185","type":"journal-article","created":{"date-parts":[[2017,1,26]],"date-time":"2017-01-26T08:36:33Z","timestamp":1485419793000},"page":"1750018","source":"Crossref","is-referenced-by-count":2,"title":["Coefficient of domination in graph"],"prefix":"10.1142","volume":"09","author":[{"given":"Angsuman","family":"Das","sequence":"first","affiliation":[{"name":"Department of Mathematics, St. Xavier\u2019s College, 30 Park Street, Kolkata-700016, India"}]}],"member":"219","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"key":"S1793830917500185BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.12.018"},{"key":"S1793830917500185BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00180-7"},{"key":"S1793830917500185BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.05.006"},{"key":"S1793830917500185BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00572-3"},{"key":"S1793830917500185BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00131-4"},{"key":"S1793830917500185BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90308-7"},{"key":"S1793830917500185BIB008","first-page":"129","volume":"54","author":"Goddard W.","year":"2000","journal-title":"Ars Combin."},{"key":"S1793830917500185BIB009","first-page":"153","volume":"71","author":"Grinstead D. L.","year":"1990","journal-title":"Congress. Numer."},{"key":"S1793830917500185BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90020-5"},{"key":"S1793830917500185BIB011","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"Hammack R.","year":"2011","edition":"2"},{"key":"S1793830917500185BIB012","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"S1793830917500185BIB013","volume-title":"Domination in Graphs: Advanced Topics","author":"Haynes T. W.","year":"1998"},{"key":"S1793830917500185BIB014","first-page":"193","volume":"74","author":"Johnson T. W.","year":"1990","journal-title":"Congr. Numer."},{"key":"S1793830917500185BIB015","doi-asserted-by":"publisher","DOI":"10.2307\/2306658"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:14:21Z","timestamp":1565183661000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":14,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2017,4,13]]},"published-print":{"date-parts":[[2017,4]]}},"alternative-id":["10.1142\/S1793830917500185"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500185","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}