Constructions of universalized Sierpiński graphs based on labeling manipulations

DOI10.1016/J.ENDM.2017.06.007zbMath1377.05171OpenAlexW2732887711MaRDI QIDQ1687837

Toru Hasunuma

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.007

zbMATH Keywords

labelingstructural propertiesuniversalized Sierpiński graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Random growth networks with exponential degree distribution

Cites Work

• Structural properties of subdivided-line graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Crossing numbers of Sierpiński‐like graphs

This page was built for publication: Constructions of universalized Sierpiński graphs based on labeling manipulations