Upper minus domination in a claw-free cubic graph

DOI10.1016/J.DISC.2005.09.050MaRDI QIDQ860466zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Weiping 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)

Cites work

• scientific article; zbMATH DE number 1109393 (Why is no real title available?)
• scientific article; zbMATH DE number 1792629 (Why is no real title available?)
• scientific article; zbMATH DE number 861417 (Why is no real title available?)
• Lower bounds on the minus domination and \(k\)-subdomination numbers.
• Minus domination in graphs
• Minus domination in regular graphs
• Minus domination number in \(k\)-partite graphs.
• Minus domination number in cubic graph
• Signed domination in regular graphs
• The algorithmic complexity of minus domination in graphs
• Upper minus domination in regular graphs

Cited in

(7)

• Upper total domination in claw‐free graphs
• An application of the Turán theorem to domination in graphs
• Dominating functions with integer values in graphs—a survey
• Upper paired-domination in claw-free graphs
• Domination versus edge domination on claw-free graphs
• Signed and minus dominating functions in graphs
• On complexities of minus domination

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860466)