{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:27:42Z","timestamp":1774466862294,"version":"3.50.1"},"reference-count":9,"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":[[2024,8]]},"abstract":"<jats:p> Given a graph [Formula: see text] with no isolated vertices, let [Formula: see text] [Formula: see text] [Formula: see text] [Formula: see text] [Formula: see text] and [Formula: see text] denote the ev-domination number, the independent ev-domination number, the upper independent ev-domination number, the domination number, the paired-domination number and the upper paired-domination number, respectively. It is known that [Formula: see text] In this paper, we extend this inequality chain to involve the upper paired-domination number for arbitrary graphs [Formula: see text] with no isolated vertices as well as the domination number for trees. Moreover, we show that recognizing well ev-covered graphs (i.e., graphs [Formula: see text] with [Formula: see text]) is co-NP-complete, solving an open problem posed by Boutrig and Chellali. <\/jats:p>","DOI":"10.1142\/s1793830923500805","type":"journal-article","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T03:14:11Z","timestamp":1694574851000},"source":"Crossref","is-referenced-by-count":1,"title":["Further results on independent edge-vertex domination"],"prefix":"10.1142","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5231-6195","authenticated-orcid":false,"given":"Mustapha","family":"Chellali","sequence":"first","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":[[2023,10,18]]},"reference":[{"key":"S1793830923500805BIB001","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2023088"},{"key":"S1793830923500805BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.07.087"},{"key":"S1793830923500805BIB003","doi-asserted-by":"publisher","DOI":"10.2989\/160736007780205693"},{"key":"S1793830923500805BIB004","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"S1793830923500805BIB005","first-page":"1","author":"Hedetniemi S. M.","year":"2014","journal-title":"Graph Theory Notes New York"},{"key":"S1793830923500805BIB007","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830921500452"},{"key":"S1793830923500805BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80011-4"},{"key":"S1793830923500805BIB010","doi-asserted-by":"publisher","DOI":"10.1080\/16073606.1993.9631737"},{"key":"S1793830923500805BIB011","doi-asserted-by":"publisher","DOI":"10.1142\/S0219691323500145"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923500805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T03:01:17Z","timestamp":1721703677000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923500805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,18]]},"references-count":9,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.1142\/S1793830923500805"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923500805","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,18]]},"article-number":"2350080"}}