{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:40:19Z","timestamp":1774435219270,"version":"3.50.1"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:p>Let [Formula: see text] be a graph of order [Formula: see text]. Let [Formula: see text] and [Formula: see text] denote respectively the independent domination number, independence number and chromatic number of [Formula: see text] These parameters satisfy the well known inequality [Formula: see text]. In this paper we determine conditions under which the above inequalities become equalities and use these conditions to determine extremal graphs in some specific graph classes.<\/jats:p>","DOI":"10.1142\/s1793830925500533","type":"journal-article","created":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T23:20:16Z","timestamp":1741216816000},"source":"Crossref","is-referenced-by-count":0,"title":["Independent domination and vertex coloring in graphs"],"prefix":"10.1142","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4477-9453","authenticated-orcid":false,"given":"Subramanian","family":"Arumugam","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Ramco Institute of Technology, Rajapalayam 626 117, Tamil Nadu, India"},{"name":"Department of Mathematics, Ramanujan College, University of Delhi, Delhi 110019, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Purnima","family":"Gupta","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Ramanujan College, University of Delhi, Delhi 110019, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,4,19]]},"reference":[{"key":"S1793830925500533BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90105-X"},{"key":"S1793830925500533BIB002","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2016","edition":"6"},{"key":"S1793830925500533BIB003","volume-title":"Chromatic Graph Theory","author":"Chartrand G.","year":"2009"},{"key":"S1793830925500533BIB004","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"S1793830925500533BIB005","volume-title":"Domination in Graphs-Advanced Topics","author":"Haynes T. W.","year":"1998"},{"key":"S1793830925500533BIB006","doi-asserted-by":"publisher","DOI":"10.1080\/09728600.2020.1833692"},{"key":"S1793830925500533BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90473-F"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830925500533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T08:01:39Z","timestamp":1774425699000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830925500533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,19]]},"references-count":7,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["10.1142\/S1793830925500533"],"URL":"https:\/\/doi.org\/10.1142\/s1793830925500533","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,19]]},"article-number":"2550053"}}