Onk-tuple domination of random graphs

DOI10.1016/j.aml.2009.02.004zbMath1171.05420OpenAlexW1983052301MaRDI QIDQ735107

Bin Wang, Kai-Nan Xiang

Publication date: 14 October 2009

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

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

zbMATH Keywords

random graphdomination\(k\)-tuple domination

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

\(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Multiple Domination ⋮ The 2-tuple dominating independent number of a random graph

Cites Work

• Upper bounds for \(\alpha \)-domination parameters
• The upper bound on \(k\)-tuple domination numbers of graphs
• Proof of a conjecture on \(k\)-tuple domination in graphs
• \(k\)-tuple domination in graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• A generalised upper bound for the \(k\)-tuple domination number
• On the domination number of a random graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Onk-tuple domination of random graphs