{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:35:30Z","timestamp":1766136930884},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,2]]},"abstract":"<jats:p> A set [Formula: see text] is a [Formula: see text]-point set dominating set (2-psd set) of a graph [Formula: see text] if for any subset [Formula: see text], there exists a nonempty subset [Formula: see text] containing at most two vertices such that the subgraph [Formula: see text] induced by [Formula: see text] is connected. 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]. In this paper, we determine the lower bounds and an upper bound on [Formula: see text] of a graph. We also characterize extremal graphs for the lower bounds and identify some well-known classes of both separable and nonseparable graphs attaining the upper bound. <\/jats:p>","DOI":"10.1142\/s179383091850012x","type":"journal-article","created":{"date-parts":[[2017,12,18]],"date-time":"2017-12-18T06:14:54Z","timestamp":1513577694000},"page":"1850012","source":"Crossref","is-referenced-by-count":3,"title":["Bounds on 2-point set domination number of a graph"],"prefix":"10.1142","volume":"10","author":[{"given":"Purnima","family":"Gupta","sequence":"first","affiliation":[{"name":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Dhaula Kuan, Delhi 110021, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepti","family":"Jain","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Sri Venkateswara College, University of Delhi, Dhaula Kuan, Delhi 110021, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,2,14]]},"reference":[{"key":"S179383091850012XBIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00160-5"},{"key":"S179383091850012XBIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00389-6"},{"issue":"2","key":"S179383091850012XBIB003","first-page":"87","volume":"2","author":"Acharya B. D.","year":"2005","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"2","key":"S179383091850012XBIB004","first-page":"127","volume":"4","author":"Acharya B. D.","year":"2007","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"S179383091850012XBIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00088-E"},{"key":"S179383091850012XBIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2017.03.008"},{"key":"S179383091850012XBIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(82)90015-3"},{"key":"S179383091850012XBIB008","volume-title":"Domination in Graphs. Advanced topics","author":"Haynes T.","year":"1998"},{"key":"S179383091850012XBIB009","volume-title":"Fundamentals of domination in graphs","author":"Haynes T.","year":"1998"},{"key":"S179383091850012XBIB010","first-page":"209","volume-title":"Graph Theory and Combinatorics","author":"Hedetniemi S. T.","year":"1984"},{"key":"S179383091850012XBIB011","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90188-N"},{"key":"S179383091850012XBIB012","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90180-6"},{"key":"S179383091850012XBIB013","first-page":"607","volume":"13","author":"Sampathkumar E.","year":"1979","journal-title":"J. Math. Phys. Sci."},{"issue":"4","key":"S179383091850012XBIB014","first-page":"225","volume":"24","author":"Sampathkumar E.","year":"1993","journal-title":"Indian J. Pure Appl. Math."},{"key":"S179383091850012XBIB015","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190180507"},{"key":"S179383091850012XBIB016","volume-title":"MRI Lecture Notes in Mathematics","volume":"1","author":"Walikar H. B.","year":"1979"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091850012X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:12:22Z","timestamp":1565125942000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091850012X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":16,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2018,2,14]]},"published-print":{"date-parts":[[2018,2]]}},"alternative-id":["10.1142\/S179383091850012X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091850012x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}