Several domination numbers of a complete multipartite graph

MaRDI QIDQ3059023zbMATH OpenFDO

Authors Erfang Shan, Weiliang Zhao, Yancai Zhao

Publication date 8 December 2010

zbMATH Keywords

(total) domination numbercomplete multipartite graphminus (total) domination numbersigned (total) domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Signed and minus domination in complete multipartite graphs.
• The signed and minus k-subdomination numbers of certain complete multipartite graphs and their complements
• Remarks on the minus (signed) total domination in graphs
• Signed total \(\{ k \}\)-domination number and \(\{ k \}\)-chromatic number of a complete bipartite graph
• Signed edge domination numbers of complete tripartite graphs. I.

Cited in

(7)

• Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum
• The signed and minus k-subdomination numbers of certain complete multipartite graphs and their complements
• Signed and minus domination in complete multipartite graphs.
• The p-domination number of complete multipartite graphs
• Protection of complete multipartite graphs
• Signed total \(\{ k \}\)-domination number and \(\{ k \}\)-chromatic number of a complete bipartite graph
• Further results on complementary perfect domination number of a graph

This page was built for publication: Several domination numbers of a complete multipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059023)