Signed total \ k \-domination number and \ k \-chromatic number of a complete bipartite graph

MaRDI QIDQ4623682zbMATH OpenFDO

Authors Zhongwang Zhou

Publication date 22 February 2019

zbMATH Keywords

complete bipartite graphsigned total \(\{ k \}\)-chromatic numbersigned total \(\{ k \}\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Signed and minus domination in complete multipartite graphs.
• Signed total \(k\)-domatic numbers of graphs
• The signed and minus \(k\)-subdomination numbers of certain complete multipartite graphs and their complements
• Several domination numbers of a complete multipartite graph
• The signed edge total \(k\)-domination numbers of graphs

Cited in

(2)

• Several domination numbers of a complete multipartite graph
• Signed and minus domination in complete multipartite graphs.

This page was built for publication: Signed total \(\{ k \}\)-domination number and \(\{ k \}\)-chromatic number of a complete bipartite graph

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