Geodesic
Vertex-addition strategy for domination-like invariants
Michitaka Furuya1 ; Naoki Matsumoto2
1Kitazato University
2Seikei University
The electronic journal of combinatorics, Tome 24 (2017) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In [J. Graph Theory 13 (1989) 749—762], 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.
DOI : 10.37236/6531
Classification : 05C69
Mots-clés : domination, total domination, Roman domination

Michitaka Furuya  1   ; Naoki Matsumoto  2

1 Kitazato University
2 Seikei University 
@article{10_37236_6531,
     author = {Michitaka Furuya and Naoki Matsumoto},
     title = {Vertex-addition strategy for domination-like invariants},
     journal = {The electronic journal of combinatorics},
     year = {2017},
     volume = {24},
     number = {3},
     doi = {10.37236/6531},
     zbl = {1369.05160},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6531/}
}
TY  - JOUR
AU  - Michitaka Furuya
AU  - Naoki Matsumoto
TI  - Vertex-addition strategy for domination-like invariants
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6531/
DO  - 10.37236/6531
ID  - 10_37236_6531
ER  - 
%0 Journal Article
%A Michitaka Furuya
%A Naoki Matsumoto
%T Vertex-addition strategy for domination-like invariants
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/6531/
%R 10.37236/6531
%F 10_37236_6531
Michitaka Furuya; Naoki Matsumoto. Vertex-addition strategy for domination-like invariants. The electronic journal of combinatorics, Tome 24 (2017) no. 3. doi: 10.37236/6531

Cité par Sources :