Lower bounds on the signed domination numbers of directed graphs

DOI10.1016/j.disc.2008.04.001zbMath1211.05117OpenAlexW2025942997MaRDI QIDQ1025527

Hossein Karami, Abdollah Khodkar, Seyyed Mahmoud Sheikholeslami

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.001

zbMATH Keywords

signed domination numberdirected graphsigned dominating function

Mathematics Subject Classification ID

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

Related Items

Signed Roman \(k\)-domination in digraphs ⋮ Twin signed double Roman domination numbers in directed graphs ⋮ The signed \(k\)-domination number of directed graphs ⋮ Signed Roman domination in digraphs ⋮ Double Roman domination in digraphs ⋮ Upper bounds on the signed \((k,k)\)-domatic number of digraphs ⋮ Twin signed k-domination numbers in directed graphs

Cites Work

• Signed domination numbers of directed graphs
• An inequality for the chromatic number of a graph