Dominating sets of random recursive trees

DOI10.1016/J.ENDM.2006.08.078MaRDI QIDQ3439556zbMATH OpenOpenAlexFDO

Authors 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

algorithmsdominating setsrandom trees

Mathematics Subject Classification ID

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

Cites work

• A linear algorithm for the domination number of a tree
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 1409903 (Why is no real title available?)

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

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