{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:58:16Z","timestamp":1760245096107,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $\\gamma(n,\\delta)$ denote the maximum possible domination number  of a graph with $n$ vertices and minimum degree $\\delta$. Using  known results we determine $\\gamma(n,\\delta)$ for  $\\delta = 0, 1, 2, 3$, $n \\ge \\delta + 1$ and for all $n$, $\\delta$ where $\\delta = n-k$ and $n$ is sufficiently large relative to $k$. We also obtain $\\gamma(n,\\delta)$ for all remaining values of $(n,\\delta)$ when  $n \\le 14$ and all but 6 values of $(n,\\delta)$ when $n = 15$ or 16.<\/jats:p>","DOI":"10.37236\/1311","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T20:53:17Z","timestamp":1578689597000},"source":"Crossref","is-referenced-by-count":14,"title":["Tight Upper Bounds for the Domination Numbers of  Graphs with Given Order and Minimum Degree"],"prefix":"10.37236","volume":"4","author":[{"given":"W. Edwin","family":"Clark","sequence":"first","affiliation":[]},{"given":"Larry A.","family":"Dunning","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[1997,10,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v4i1r26\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v4i1r26\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T01:11:20Z","timestamp":1579309880000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v4i1r26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10,27]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[1997,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1311","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[1997,10,27]]},"article-number":"R26"}}