{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T05:52:43Z","timestamp":1675403563750},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p> In a graph, an edge dominates itself and all its adjacent edges. An edge dominating set (EDS) in a graph [Formula: see text] is a subset of edges that dominates every edge of [Formula: see text] In this paper, we characterize edges that are in all or in no minimum EDS in trees. <\/jats:p>","DOI":"10.1142\/s179383091950040x","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T04:42:41Z","timestamp":1560228161000},"page":"1950040","source":"Crossref","is-referenced-by-count":1,"title":["Edges contained in all or in no minimum edge dominating set of a tree"],"prefix":"10.1142","volume":"11","author":[{"given":"Nac\u00e9ra","family":"Meddah","sequence":"first","affiliation":[{"name":"LAMDA-RO Laboratory, Department of Mathematics, University of Blida, B. P. 270, Blida, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustapha","family":"Chellali","sequence":"additional","affiliation":[{"name":"LAMDA-RO Laboratory, Department of Mathematics, University of Blida, B. P. 270, Blida, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"issue":"1","key":"S179383091950040XBIB001","first-page":"1","volume":"2","author":"Blidia M.","year":"2005","journal-title":"AKCE Int. J. Graphs and Combin."},{"key":"S179383091950040XBIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00447-8"},{"key":"S179383091950040XBIB003","doi-asserted-by":"publisher","DOI":"10.1137\/0603052"},{"key":"S179383091950040XBIB004","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"S179383091950040XBIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-005-4107-3"},{"key":"S179383091950040XBIB006","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1844"},{"issue":"1","key":"S179383091950040XBIB007","first-page":"105","volume":"11","author":"Meddah N.","year":"2014","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"S179383091950040XBIB008","first-page":"489","volume":"19","author":"Mitchell S.","year":"1977","journal-title":"Congr. Numer."},{"key":"S179383091950040XBIB009","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199907)31:3<163::AID-JGT2>3.0.CO;2-T"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091950040X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T21:59:35Z","timestamp":1568671175000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091950040X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":9,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["10.1142\/S179383091950040X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091950040x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}