Proof of a conjecture on \(k\)-tuple domination in graphs

DOI10.1016/j.aml.2007.03.015zbMath1187.05054OpenAlexW1982075678WikidataQ123132585 ScholiaQ123132585MaRDI QIDQ958895

Erfang Shan, Guangjun Xu, Hong Yan, Li-ying Kang

Publication date: 10 December 2008

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

Full work available at URL: https://doi.org/10.1016/j.aml.2007.03.015

zbMATH Keywords

probabilistic methoddomination\(k\)-tuple domination

Mathematics Subject Classification ID

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

Related Items (9)

A polyhedral view to a generalization of multiple domination ⋮ 3-factor-criticality in double domination edge critical graphs ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ On upper bounds for multiple domination numbers of graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS ⋮ Onk-tuple domination of random graphs ⋮ Multiple Domination

Cites Work

• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• On Double Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof of a conjecture on \(k\)-tuple domination in graphs