Upper bounds on the signed total (k, k)-domatic number of graphs

DOI10.7151/DMGT.1823MaRDI QIDQ891310zbMATH OpenOpenAlexFDO

Authors Lutz Volkmann

Publication date 17 November 2015

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1823

zbMATH Keywords

regular graphssigned total \(k\)-dominating functionsigned total \(k\)-domination numbersigned total \((k, k)\)-domatic number

Mathematics Subject Classification ID

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

Recommendations

• Upper bounds on the signed (k, k)-domatic number
• Signed total \((k,k)\)-domatic number of a graph
• Signed total \(k\)-domatic numbers of graphs
• Signed \((k,k)\)-domatic number of a graph
• Signed total \(\{K\}\)-domination and \(\{K\}\)-domatic numbers of graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• On the signed total domatic number of a graph.
• Signed Total Domination Nnumber of a Graph
• Signed total \((k,k)\)-domatic number of a graph
• Signed total domination in graphs.
• The signed \(k\)-domination numbers in graphs.

Cited in

(6)

• Upper bounds on the signed total domatic number of graphs
• Signed total \((k,k)\)-domatic number of a graph
• Edge weighting functions on dominating sets
• Upper bounds on the signed \((k,k)\)-domatic number of digraphs
• Signed total \(\{K\}\)-domination and \(\{K\}\)-domatic numbers of graphs
• Upper bounds on the signed (k, k)-domatic number

This page was built for publication: Upper bounds on the signed total \((k, k)\)-domatic number of graphs

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