Upper minus domination in a claw-free cubic graph

DOI10.1016/J.DISC.2005.09.050zbMath1106.05072OpenAlexW2089848382MaRDI QIDQ860466

Jinjiang Yuan, Wei-Ping Shang

Publication date: 9 January 2007

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

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

Mathematics Subject Classification ID

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

Related Items (4)

An application of the Turán theorem to domination in graphs ⋮ On complexities of minus domination ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Signed domination in regular graphs
• Minus domination in regular graphs
• The algorithmic complexity of minus domination in graphs
• Minus domination number in cubic graph

This page was built for publication: Upper minus domination in a claw-free cubic graph