Signed and Minus Domination in Complete Multipartite Graphs
Discrete Mathematics
2012-05-03 v1 Combinatorics
Abstract
In this paper we determine the exact values of the signed domination number, signed total domination number, and minus domination number of complete multipartite graphs, which substantially generalizes some previous results obtained for special subclasses of complete multipartite graphs such as cliques and complete bipartite graphs.
Cite
@article{arxiv.1205.0343,
title = {Signed and Minus Domination in Complete Multipartite Graphs},
author = {Hongyu Liang},
journal= {arXiv preprint arXiv:1205.0343},
year = {2012}
}
Comments
Accepted to Ars Combinatoria