Degree sequence of the generalized Sierpiński ‎graph

Ali Behtoei, Mahsa Khatibi & Fatemeh Attarzadeh
Sierpiński graphs are studied in fractal theory and have applications in diverse areas including dynamic systems, chemistry, psychology, probability, and computer science. Polymer networks and WK-recursive networks can be modeled by generalized Sierpiński graphs. The degree sequence of (ordinary) Sierpi\'nski graphs and Hanoi graphs (and some of their topological indices) are determined in the literature. The number of leaves (vertices of degree one) of the generalized Sierpiński graph $S(T, t)$ of any tree $T$ was...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.