Upper bounds on the signed \((k,k)\)-domatic number of digraphs

DOI10.1007/s40840-014-0104-yzbMath1322.05067OpenAlexW2021041157MaRDI QIDQ745940

Lutz Volkmann

Publication date: 15 October 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-014-0104-y

zbMATH Keywords

signed \(k\)-dominating functionsigned \(k\)-domination numberregular digraphssigned \((k, k)\)-domatic number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items

The signed edge-domatic number of nearly cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of graphs with equal domination number and vertex cover number
• On the distance paired-domination of circulant graphs
• The signed \(k\)-domination number of directed graphs
• Lower bounds on the signed domination numbers of directed graphs
• Signed \(k\)-domatic numbers of digraphs
• On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
• Global signed domination in graphs
• Signed domination and signed domatic numbers of digraphs
• Signed domination numbers of directed graphs