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

DOI10.1007/S40840-014-0104-YMaRDI QIDQ745940zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The signed \((k,k)\)-domatic number of digraphs
• Upper bounds on the signed (k, k)-domatic number
• Signed total \((k,k)\)-domatic number of digraphs
• Signed total \(k\)-domatic numbers of digraphs
• Upper bounds on the signed total \((k, k)\)-domatic number 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?)
• A characterization of graphs with equal domination number and vertex cover number
• Global signed domination in graphs
• Lower bounds on the signed domination numbers of directed graphs
• On the distance paired-domination of circulant graphs
• On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
• Signed \(k\)-domatic numbers of digraphs
• Signed domination and signed domatic numbers of digraphs
• Signed domination numbers of directed graphs
• The signed \((k,k)\)-domatic number of digraphs
• The signed \(k\)-domination number of directed graphs

Cited in

(6)

• Signed \(k\)-domatic numbers of digraphs
• Signed total \((k,k)\)-domatic number of digraphs
• Signed total \(k\)-domatic numbers of digraphs
• The signed \((k,k)\)-domatic number of digraphs
• Upper bounds on the signed (\(k, k\))-domatic number
• The signed edge-domatic number of nearly cubic graphs

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

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