A lower bound on the total signed domination numbers of graphs

DOI10.1007/s11425-007-0053-0zbMath1128.05039OpenAlexW2171264178MaRDI QIDQ2461516

Xin-zhong Lü

Publication date: 28 November 2007

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0053-0

zbMATH Keywords

total signed domination functiontotal signed domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Signed mixed Roman domination numbers in graphs ⋮ On the complexity of variations of mixed domination on graphs^† ⋮ Signed mixed dominating functions in complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the lower bounds of signed domination number of a graph
• Signed domination in regular graphs
• On signed edge domination numbers of graphs

This page was built for publication: A lower bound on the total signed domination numbers of graphs