{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:05Z","timestamp":1759063505297,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper, we investigate the relation between the (fractional)\u00a0domination number of a digraph $G$ and the independence number of its\u00a0underlying graph, denoted by $\\alpha(G)$. More precisely, we prove\u00a0that every digraph $G$ on $n$ vertices has fractional domination number at most\u00a0$2\\alpha(G)$ and domination number at most $2\\alpha(G) \\cdot \\log{n}$.\u00a0Both bounds are sharp.<\/jats:p>","DOI":"10.37236\/7211","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:16:07Z","timestamp":1578669367000},"source":"Crossref","is-referenced-by-count":6,"title":["Domination and Fractional Domination in Digraphs"],"prefix":"10.37236","volume":"25","author":[{"given":"Ararat","family":"Harutyunyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien-Nam","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alantha","family":"Newman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomasse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2018,8,16]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p32\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p32\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:27:13Z","timestamp":1579235233000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i3p32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,16]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,7,12]]}},"URL":"https:\/\/doi.org\/10.37236\/7211","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,8,16]]},"article-number":"P3.32"}}