Signed total \ k \-domination number and \ k \-chromatic number of a complete bipartite graph
From MaRDI portal
Publication:4623682
zbMATH Open1424.05232MaRDI QIDQ4623682FDOQ4623682
Authors: Zhongwang Zhou
Publication date: 22 February 2019
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
complete bipartite graphsigned total \(\{ k \}\)-chromatic numbersigned total \(\{ k \}\)-domination number
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (2)
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)