An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne–Goodman–Hedetniemi algorithm Original Research Article

A random recursive tree on image vertices is either a single isolated vertex (for image) or is a vertex image connected to a vertex chosen uniformly at random from a random recursive tree on image vertices. Such trees have been studied before [R. Smythe, H. Mahmoud, A survey of recursive trees, Theory of Probability and Mathematical Statistics 51 (1996) 1–29] as models of boolean circuits. More recently, Barabási and Albert [A. Barabási, R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509–512] have used modifications of such models to model for the web and other “power-law” networks.