The signed k-domination number of directed graphs
DOI10.2478/S11533-010-0077-5zbMATH Open1223.05092OpenAlexW2030378184MaRDI QIDQ632269FDOQ632269
M. Atapour, Lutz Volkmann, Rana Hajypory, Seyed Mahmood Sheikholeslami
Publication date: 15 March 2011
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-010-0077-5
Recommendations
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- The signed \(k\)-domination numbers in graphs.
- Lower bounds on the signed domination numbers of directed graphs
- Signed domination numbers of directed graphs
- Title not available (Why is that?)
- Inequalities relating domination parameters in cubic graphs
- An inequality for the chromatic number of a graph
- A note on the lower bounds of signed domination number of a graph
Cited In (12)
- New and improved results on the signed (total) k-domination number of graphs
- Twin signed double Roman domination numbers in directed graphs
- Twin signed k-domination numbers in directed graphs
- ON MINIMAL DOMINATING SETS FOR SIGNED GRAPHS
- Title not available (Why is that?)
- Signed Roman \(k\)-domination in digraphs
- Signed Roman domination in digraphs
- Upper bounds on the signed \((k,k)\)-domatic number of digraphs
- Lower bounds on the signed (total) $k$-domination number
- Signed distance \(k\)-domatic numbers of graphs
- On the signed (total) \(k\)-domination number of a graph
- An introduction to the twin signed total k-domination numbers in directed graphs
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)
