{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T07:13:10Z","timestamp":1756192390417,"version":"3.41.2"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:p> A dominating set [Formula: see text] is said to be a captive dominating set of [Formula: see text] if [Formula: see text] has no isolated vertex ([Formula: see text] is a total dominating set) and each vertex [Formula: see text] is adjacent to at least one vertex in [Formula: see text]. A captive dominating set [Formula: see text] is said to be a minimal captive dominating set if no proper subset [Formula: see text] of [Formula: see text] is a captive dominating set. The minimum cardinality of a minimal captive dominating set of [Formula: see text] is called the captive domination number of [Formula: see text] which is denoted by [Formula: see text]. In this paper, we have characterized some results, determine the values of the domination-related parameters for the graph and its splitting graph, relate captive domination and packing number of a graph, etc. We have also constructed graphs for which [Formula: see text] <\/jats:p>","DOI":"10.1142\/s1793830923500489","type":"journal-article","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T13:34:02Z","timestamp":1683725642000},"source":"Crossref","is-referenced-by-count":1,"title":["Some new results on captive dominating sets in graphs"],"prefix":"10.1142","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5394-1424","authenticated-orcid":false,"given":"S. K.","family":"Vaidya","sequence":"first","affiliation":[{"name":"Department of Mathematics, Saurashtra University, Rajkot 360005, Gujarat, India"}]},{"given":"H. D.","family":"Vadhel","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Saurashtra University, Rajkot 360005, Gujarat, India"}]}],"member":"219","published-online":{"date-parts":[[2023,6,5]]},"reference":[{"key":"S1793830923500489BIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500767"},{"key":"S1793830923500489BIB002","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500251"},{"key":"S1793830923500489BIB003","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/41.3.269"},{"key":"S1793830923500489BIB004","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070305"},{"key":"S1793830923500489BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100304"},{"key":"S1793830923500489BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830921501330"},{"issue":"4","key":"S1793830923500489BIB007","first-page":"631","volume":"8","author":"Deepalakshmi J.","year":"2023","journal-title":"Commun. Comb. Optim."},{"key":"S1793830923500489BIB008","doi-asserted-by":"publisher","DOI":"10.1201\/9781482246582"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"2017","author":"Haynes T. W.","key":"S1793830923500489BIB009"},{"volume-title":"Topics on Domination","year":"1991","author":"Hedetniemi S. T.","key":"S1793830923500489BIB010"},{"key":"S1793830923500489BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90365-O"},{"key":"S1793830923500489BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.044"},{"key":"S1793830923500489BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6"},{"key":"S1793830923500489BIB014","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500688"},{"key":"S1793830923500489BIB015","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830921500981"},{"key":"S1793830923500489BIB016","first-page":"1571","volume":"102","author":"Vaidya S. K.","year":"2017","journal-title":"Far East J. Math. Sci."},{"volume-title":"Introduction to Graph Theory","year":"2001","author":"West D. B.","key":"S1793830923500489BIB017"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923500489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T07:35:21Z","timestamp":1713166521000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923500489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,5]]},"references-count":17,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["10.1142\/S1793830923500489"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923500489","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2023,6,5]]},"article-number":"2350048"}}