Signed and Minus Domination in Complete Multipartite Graphs

2012/05/02 by Hongyu Liang, Liang, Hongyu
Computer Science · Mathematics · #05C69 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:05C69

paper · pdf · doi:10.48550/arxiv.1205.0343

Accepted to Ars Combinatoria

arxiv created 2012/05/02 · arxiv updated 2012/05/03

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.

Related

• The p-Domination Number of Complete Multipartite Graphs
• Discrepancy and Signed Domination in Graphs and Hypergraphs
• Graphs with equal domination and certified domination numbers
• Signed edge domination numbers of complete tripartite graphs: Part 2
• Total Domination Index in Graphs