Upper bounds for domination related parameters in graphs on surfaces
Combinatorics
2013-10-08 v1
Abstract
In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the restrained bondage number, the total restrained bondage number and the restricted edge connectivity of graphs in terms of the orientable/nonorientable genus and maximum degree.
Cite
@article{arxiv.1310.1610,
title = {Upper bounds for domination related parameters in graphs on surfaces},
author = {Vladimir Samodivkin},
journal= {arXiv preprint arXiv:1310.1610},
year = {2013}
}
Comments
10 pages