{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T09:35:20Z","timestamp":1761212120746,"version":"build-2065373602"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:p>A set [Formula: see text] of vertices of a simple graph [Formula: see text] is a strong dominating set, if for every vertex [Formula: see text] there is a vertex [Formula: see text] with [Formula: see text] and [Formula: see text]. The strong domination number [Formula: see text] is defined as the minimum cardinality of a strong dominating set. The strong domatic number [Formula: see text] is the maximum number of strong dominating sets into which the vertex set of [Formula: see text] can be partitioned. We initiate the study of the strong domatic number, and we present different sharp bounds on [Formula: see text]. In addition, we determine this parameter for some classes of graphs such as cubic graphs of order at most [Formula: see text].<\/jats:p>","DOI":"10.1142\/s179383092450126x","type":"journal-article","created":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T08:08:11Z","timestamp":1731658091000},"source":"Crossref","is-referenced-by-count":0,"title":["Strong domatic number of a graph"],"prefix":"10.1142","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5063-3461","authenticated-orcid":false,"given":"Nima","family":"Ghanbari","sequence":"first","affiliation":[{"name":"Department of Informatics, University of Bergen, P. O. Box 7803, 5020 Bergen, Norway"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1801-203X","authenticated-orcid":false,"given":"Saeid","family":"Alikhani","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Yazd University, P. O. Box 89195-741, Yazd, Iran"}]}],"member":"219","published-online":{"date-parts":[[2024,12,23]]},"reference":[{"key":"S179383092450126XBIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2010.03.007"},{"issue":"4","key":"S179383092450126XBIB002","first-page":"773","volume":"9","author":"Alikhani S.","year":"2024","journal-title":"Commun. Comb. Optim."},{"issue":"3","key":"S179383092450126XBIB003","first-page":"355","volume":"35","author":"Alikhani S.","year":"2011","journal-title":"Turkish J. Math."},{"issue":"1","key":"S179383092450126XBIB004","first-page":"45","volume":"1","author":"Aram H.","year":"2012","journal-title":"Trans. Comb."},{"key":"S179383092450126XBIB005","doi-asserted-by":"publisher","DOI":"10.7494\/OpMath.2012.32.2.235"},{"key":"S179383092450126XBIB006","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070305"},{"key":"S179383092450126XBIB007","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100304"},{"key":"S179383092450126XBIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.11.031"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S179383092450126XBIB009"},{"key":"S179383092450126XBIB010","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6"},{"key":"S179383092450126XBIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.044"},{"key":"S179383092450126XBIB012","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00248-4"},{"key":"S179383092450126XBIB013","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00231-K"},{"issue":"1","key":"S179383092450126XBIB014","first-page":"65","volume":"11","author":"Zaherifar H.","year":"2023","journal-title":"J. Alg. Sys."},{"key":"S179383092450126XBIB015","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021759001873"},{"key":"S179383092450126XBIB016","first-page":"145","volume":"33","author":"Zelinka B.","year":"1983","journal-title":"Math. Slovaca"},{"key":"S179383092450126XBIB017","first-page":"91","volume":"31","author":"Zelinka B.","year":"1981","journal-title":"Math. Slovaca"},{"key":"S179383092450126XBIB018","first-page":"7","volume":"39","author":"Zelinka B.","year":"1989","journal-title":"Math. Slovaca"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383092450126X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T09:31:52Z","timestamp":1761211912000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S179383092450126X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,23]]},"references-count":18,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1142\/S179383092450126X"],"URL":"https:\/\/doi.org\/10.1142\/s179383092450126x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2024,12,23]]},"article-number":"2450126"}}