Size, Order, and Connected Domination
Canadian mathematical bulletin, Tome 57 (2014) no. 1, pp. 141-144
Voir la notice de l'article provenant de la source Cambridge
We give a sharp upper bound on the size of a triangle-free graph of a given order and connected domination. Our bound, apart from strengthening an old classical theorem of Mantel and of Turán improves on a theorem of Sanchis. Further, as corollaries, we settle a long standing conjecture of Graffiti on the leaf number and local independence for triangle-free graphs and answer a question of Griggs, Kleitman, and Shastri on a lower bound of the leaf number in triangle-free graphs.
Mots-clés :
05C69, size, connected domination, local independence number, leaf number
Mukwembi, Simon. Size, Order, and Connected Domination. Canadian mathematical bulletin, Tome 57 (2014) no. 1, pp. 141-144. doi: 10.4153/CMB-2013-020-5
@article{10_4153_CMB_2013_020_5,
author = {Mukwembi, Simon},
title = {Size, {Order,} and {Connected} {Domination}},
journal = {Canadian mathematical bulletin},
pages = {141--144},
year = {2014},
volume = {57},
number = {1},
doi = {10.4153/CMB-2013-020-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2013-020-5/}
}
Cité par Sources :