An application of the Turán theorem to domination in graphs

DOI10.1016/j.dam.2007.11.008zbMath1229.05223OpenAlexW2038420276MaRDI QIDQ948691

Erfang Shan, Cheng, T. C. Edwin, Li-ying Kang

Publication date: 17 October 2008

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

Full work available at URL: http://hdl.handle.net/10397/1261

zbMATH Keywords

cliqueminus dominationsigned dominationTurán theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Signed and Minus Dominating Functions in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on domination and minus domination numbers in cubic graphs
• Upper minus domination in a claw-free cubic graph
• A note on graphs with large girth and small minus domination number
• Minus domination in graphs
• Lower bounds on the minus domination and \(k\)-subdomination numbers.
• Minus domination number in \(k\)-partite graphs.
• Upper minus domination in regular graphs
• On the signed domination in graphs
• A proof of a conjecture of minus domination in graphs
• Minus domination in regular graphs
• The algorithmic complexity of minus domination in graphs
• On the Minus Domination Number of Graphs
• Minus domination in small-degree graphs
• Lower bound on the minus-domination number
• Minus domination number in cubic graph