Two Short Proofs on Total Domination
Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 2, p. 457.

Voir la notice de l'article dans European Digital Mathematics Library

A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set. We provide a short proof of the result that Υt (G) ≤ 2/3n for connected graphs with n ≥ 3 and a short characterization of the extremal graphs.
Classification : 05C69
Mots-clés : total domination 
@article{DMGT_2013__33_2_268215,
     author = {Allan Bickle},
     title = {Two {Short} {Proofs} on {Total} {Domination}},
     journal = {Discussiones Mathematicae Graph Theory},
     pages = {457},
     publisher = {mathdoc},
     volume = {33},
     number = {2},
     year = {2013},
     zbl = {1293.05255},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_268215/}
}
TY  - JOUR
AU  - Allan Bickle
TI  - Two Short Proofs on Total Domination
JO  - Discussiones Mathematicae Graph Theory
PY  - 2013
SP  - 457
VL  - 33
IS  - 2
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_268215/
LA  - en
ID  - DMGT_2013__33_2_268215
ER  - 
%0 Journal Article
%A Allan Bickle
%T Two Short Proofs on Total Domination
%J Discussiones Mathematicae Graph Theory
%D 2013
%P 457
%V 33
%N 2
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_268215/
%G en
%F DMGT_2013__33_2_268215
Allan Bickle. Two Short Proofs on Total Domination. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 2, p. 457. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_2_268215/