{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:22Z","timestamp":1740155962851,"version":"3.37.3"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:p> Let [Formula: see text] be a simple graph with vertex set [Formula: see text] and edge set [Formula: see text]. An outer-paired dominating set [Formula: see text] of a graph [Formula: see text] is a dominating set such that the subgraph induced by [Formula: see text] has a perfect matching. The outer-paired domination number of [Formula: see text], denoted by [Formula: see text], is the minimum cardinality of an outer-paired dominating set of [Formula: see text]. In this paper, we study the outer-paired domination number of graphs and present some sharp bounds concerning the invariant. Also, we characterize all the trees with [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s179383092050072x","type":"journal-article","created":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T03:25:45Z","timestamp":1591241145000},"page":"2050072","source":"Crossref","is-referenced-by-count":2,"title":["Outer-paired domination in graphs"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1943-5552","authenticated-orcid":false,"given":"A.","family":"Mahmoodi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Payame Noor University (PNU), P. O. Box 19395-4697 Tehran, Iran"}]},{"given":"L.","family":"Asgharsharghi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran"}]}],"member":"219","published-online":{"date-parts":[[2020,7,20]]},"reference":[{"key":"S179383092050072XBIB001","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jgt.3190010209","volume":"1","author":"Alavi Y.","year":"1977","journal-title":"J. Graph Theory"},{"key":"S179383092050072XBIB002","first-page":"3","volume":"73","author":"Chellali M.","year":"2004","journal-title":"Ars Combin."},{"key":"S179383092050072XBIB003","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(77)90102-9","volume":"19","author":"Erd\u00f6s P.","year":"1977","journal-title":"Discrete Math."},{"key":"S179383092050072XBIB004","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7151\/dmgt.1063","volume":"18","author":"Fitzpatrick S.","year":"1998","journal-title":"Discuss. Math. Graph Theory"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S179383092050072XBIB005"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S179383092050072XBIB006"},{"key":"S179383092050072XBIB007","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F","volume":"32","author":"Haynes T. W.","year":"1998","journal-title":"Networks"},{"key":"S179383092050072XBIB008","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10878-006-9014-8","volume":"13","author":"Henning M. A.","year":"2007","journal-title":"J. Combin. Optim."},{"key":"S179383092050072XBIB009","first-page":"33","volume":"18","author":"Jacobson M. S.","year":"1983","journal-title":"Ars Combin."},{"key":"S179383092050072XBIB010","first-page":"71","volume-title":"The 32nd Workshop on Combinatorial Mathematics and Computation Theory","author":"Lin C. Y.","year":"2015"},{"key":"S179383092050072XBIB011","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1021338214295","volume":"25","author":"Qiao H.","year":"2003","journal-title":"J. Global Optim."},{"key":"S179383092050072XBIB012","series-title":"MRI Lecture Notes in Mathematics","volume-title":"Recent Developments in the Theory of Domination in Graphs","volume":"1","author":"Walikar H. B.","year":"1979"},{"key":"S179383092050072XBIB013","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001","edition":"2"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383092050072X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,29]],"date-time":"2020-11-29T04:59:45Z","timestamp":1606625985000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383092050072X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,20]]},"references-count":13,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["10.1142\/S179383092050072X"],"URL":"https:\/\/doi.org\/10.1142\/s179383092050072x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,7,20]]}}}