Modeling complex networks with self-similar outerplanar unclustered graphs

This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Relevant properties of this family are comparable to those of some networks associated with technological systems with a low clustering, like the power grid or some electronic circuits. Moreover, the graphs are outerplanar and it is know that many algorithms that are NP-complete for general graphs perform polynomial in outerplanar graphs. Therefore the graphs constitute a good mathematical model for these systems.