{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:54Z","timestamp":1753893834216,"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 [J. Graph Theory 13\u00a0(1989) 749\u2014762], McCuaig and Shepherd gave an upper bound of the domination number for connected graphs with minimum degree at least two. In this paper, we propose a simple strategy which, together with the McCuaig-Shepherd theorem, gives a sharp upper bound of the domination number via the number of leaves. We also apply the same strategy to other domination-like invariants, and find a relationship between such invariants and the number of leaves.<\/jats:p>","DOI":"10.37236\/6531","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:46:25Z","timestamp":1578671185000},"source":"Crossref","is-referenced-by-count":0,"title":["Vertex-Addition Strategy for Domination-Like Invariants"],"prefix":"10.37236","volume":"24","author":[{"given":"Michitaka","family":"Furuya","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Matsumoto","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2017,9,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i3p45\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i3p45\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:46:33Z","timestamp":1579236393000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i3p45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,8]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2017,7,14]]}},"URL":"https:\/\/doi.org\/10.37236\/6531","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,9,8]]},"article-number":"P3.45"}}