Signed and Minus Domination in Complete Multipartite Graphs
Hongyu Liang
TL;DR
This paper determines the exact values of various domination parameters in complete multipartite graphs, extending known results from special cases like cliques and bipartite graphs.
Contribution
It provides exact values for signed and minus domination numbers in complete multipartite graphs, generalizing previous specific case results.
Findings
Exact signed domination number determined
Exact signed total domination number determined
Exact minus domination number determined
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Interconnection Networks and Systems