The signed k-domination number of directed graphs
From MaRDI portal
Publication:632269
Recommendations
Cites work
- A note on the lower bounds of signed domination number of a graph
- An inequality for the chromatic number of a graph
- scientific article; zbMATH DE number 861417 (Why is no real title available?)
- Inequalities relating domination parameters in cubic graphs
- Lower bounds on the signed domination numbers of directed graphs
- Signed domination numbers of directed graphs
- The signed k-domination numbers in graphs.
Cited in
(15)- Signed distance k-domatic numbers of graphs
- On the signed (total) k-domination number of a graph
- Signed Roman \(k\)-domination in digraphs
- Upper signed k-domination number of directed graphs
- ON MINIMAL DOMINATING SETS FOR SIGNED GRAPHS
- An introduction to the twin signed total -domination numbers in directed graphs
- Lower bounds on the signed (total) \(k\)-domination number
- Signed Roman domination in digraphs
- Twin signed \(k\)-domination numbers in directed graphs
- New and improved results on the signed (total) k-domination number of graphs
- scientific article; zbMATH DE number 5876397 (Why is no real title available?)
- Signed domatic number of directed circulant graphs
- Twin signed double Roman domination numbers in directed graphs
- The minus k-domination numbers in digraphs
- Upper bounds on the signed \((k,k)\)-domatic number of digraphs
This page was built for publication: The signed \(k\)-domination number of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632269)