  We introduce recursive corona graphs as a model of small-world networks. We
investigate analytically the critical characteristics of the model, including
order and size, degree distribution, average path length, clustering
coefficient, and the number of spanning trees, as well as Kirchhoff index.
Furthermore, we study the spectra for the adjacency matrix and the Laplacian
matrix for the model. We obtain explicit results for all the quantities of the
recursive corona graphs, which are similar to those observed in real-life
networks.
