Toughness and Hamiltonicity in Random Apollonian Networks

Abstract

In this paper we study the toughness of Random Apollonian Networks (RANs), a random graph model which generates planar graphs with power-law properties. We consider their important characteristics: every RAN is a uniquely representable chordal graph and a planar $3$-tree and as so, known results about these classes can be particularized. We establish a partition of the class in eight nontrivial subclasses and for each one of these subclasses we provide bounds for the toughness of their elements. We also study the hamiltonicity of the elements of these subclasses.

15 pages, 5 figures

References in corpus (1)

• On the Longest Paths and the Diameter in Random Apollonian Networks