Dominating sets of random recursive trees

DOI10.1016/j.endm.2006.08.078zbMath1293.05283OpenAlexW2045622282MaRDI QIDQ3439556

Colin Cooper, Michele Zito

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2006.08.078

zbMATH Keywords

algorithmsrandom treesdominating sets

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A linear algorithm for the domination number of a tree
• Emergence of Scaling in Random Networks

This page was built for publication: Dominating sets of random recursive trees