The signed \(k\)-domination number of directed graphs

DOI10.2478/s11533-010-0077-5zbMath1223.05092OpenAlexW2030378184MaRDI QIDQ632269

Maryam Atapour, Lutz Volkmann, Rana Hajypory, Seyyed Mahmoud 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

zbMATH Keywords

directed graphsigned \(k\)-dominating functionsigned \(k\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Signed Roman \(k\)-domination in digraphs ⋮ An introduction to the twin signed total k-domination numbers in directed graphs ⋮ New and improved results on the signed (total) k-domination number of graphs ⋮ Twin signed double Roman domination numbers in directed graphs ⋮ Signed Roman domination in digraphs ⋮ Lower bounds on the signed (total) $k$-domination number ⋮ Upper bounds on the signed \((k,k)\)-domatic number of digraphs ⋮ Twin signed k-domination numbers in directed graphs

Cites Work

• Lower bounds on the signed domination numbers of directed graphs
• A note on the lower bounds of signed domination number of a graph
• Inequalities relating domination parameters in cubic graphs
• Signed domination numbers of directed graphs
• An inequality for the chromatic number of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: The signed \(k\)-domination number of directed graphs