Upper bounds on the signed (k,k)-domatic number of digraphs
DOI10.1007/S40840-014-0104-YzbMATH Open1322.05067OpenAlexW2021041157MaRDI QIDQ745940FDOQ745940
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
Recommendations
signed \(k\)-dominating functionsigned \(k\)-domination numberregular digraphssigned \((k, k)\)-domatic number
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signed \(k\)-domatic numbers of digraphs
- On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
- Global signed domination in graphs
- A characterization of graphs with equal domination number and vertex cover number
- Lower bounds on the signed domination numbers of directed graphs
- Signed domination and signed domatic numbers of digraphs
- Signed domination numbers of directed graphs
- The signed \(k\)-domination number of directed graphs
- The signed \((k,k)\)-domatic number of digraphs
- On the distance paired-domination of circulant graphs
Cited In (6)
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)
