{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:51:15Z","timestamp":1766137875743,"version":"3.41.2"},"reference-count":17,"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":[[2022,11]]},"abstract":"<jats:p> In a graph [Formula: see text], a set [Formula: see text] is a [Formula: see text]-point set dominating set (in short 2-psd set) of [Formula: see text] if for every subset [Formula: see text] there exists a nonempty subset [Formula: see text] containing at most two vertices such that the induced subgraph [Formula: see text] is connected in [Formula: see text]. The [Formula: see text]-point set domination number of [Formula: see text], denoted by [Formula: see text], is the minimum cardinality of a 2-psd set of [Formula: see text]. The main focus of this paper is to find the value of [Formula: see text] for a separable graph and thereafter computing [Formula: see text] for some well-known classes of separable graphs. Further we classify the set of all 2-psd sets of a separable graph into six disjoint classes and study the existence of minimum 2-psd sets in each class. <\/jats:p>","DOI":"10.1142\/s1793830922500446","type":"journal-article","created":{"date-parts":[[2021,12,28]],"date-time":"2021-12-28T02:34:02Z","timestamp":1640658842000},"source":"Crossref","is-referenced-by-count":3,"title":["2-Point set domination in separable graphs"],"prefix":"10.1142","volume":"14","author":[{"given":"Purnima","family":"Gupta","sequence":"first","affiliation":[{"name":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6682-7452","authenticated-orcid":false,"given":"Deepti","family":"Jain","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,12,28]]},"reference":[{"key":"S1793830922500446BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00389-6"},{"issue":"1","key":"S1793830922500446BIB002","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10587-006-0008-6","volume":"56","author":"Acharya B. D.","year":"2006","journal-title":"Czechoslovak Math. J."},{"key":"S1793830922500446BIB003","volume-title":"Graphs & Digraphs","volume":"22","author":"Chartrand G.","year":"1996"},{"key":"S1793830922500446BIB004","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-45655-4_24","volume-title":"International Computing and Combinatorics Conference","author":"Duckworth W.","year":"2002"},{"issue":"7","key":"S1793830922500446BIB005","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.disc.2012.11.031","volume":"313","author":"Goddard W.","year":"2013","journal-title":"Discrete Math."},{"key":"S1793830922500446BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S179383091850012X"},{"key":"S1793830922500446BIB007","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.endm.2016.05.019","volume":"53","author":"Gupta P.","year":"2016","journal-title":"Electron. Notes Discrete Math."},{"key":"S1793830922500446BIB008","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"volume-title":"Domination in Graphs: Volume 2: Advanced Topics","year":"2017","author":"Haynes T. W.","key":"S1793830922500446BIB009"},{"key":"S1793830922500446BIB010","doi-asserted-by":"publisher","DOI":"10.1201\/9781482246582"},{"issue":"3","key":"S1793830922500446BIB011","doi-asserted-by":"crossref","first-page":"80","DOI":"10.56947\/gjom.v4i3.76","volume":"4","author":"Jain D.","year":"2016","journal-title":"Gulf J. Math."},{"issue":"2","key":"S1793830922500446BIB012","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.akcej.2017.03.008","volume":"14","author":"Jain D.","year":"2017","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"04","key":"S1793830922500446BIB013","doi-asserted-by":"crossref","first-page":"1650067","DOI":"10.1142\/S1793830916500671","volume":"8","author":"Krishnakumari B.","year":"2016","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922500446BIB014","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830921300010"},{"issue":"4","key":"S1793830922500446BIB015","first-page":"225","volume":"24","author":"Sampathkumar E.","year":"1993","journal-title":"Indian J. Pure Appl. Math."},{"key":"S1793830922500446BIB016","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190180507"},{"issue":"6","key":"S1793830922500446BIB017","doi-asserted-by":"crossref","first-page":"2150083-1","DOI":"10.1142\/S179383092150083X","volume":"13","author":"Swaminathan V.","year":"2021","journal-title":"Discrete Math. Algorithms Appl."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T05:54:06Z","timestamp":1669701246000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,28]]},"references-count":17,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["10.1142\/S1793830922500446"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500446","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,12,28]]},"article-number":"2250044"}}