Metric properties of Sierpiński triangle graphs

DOI10.1016/j.dam.2021.03.002zbMath1494.05036OpenAlexW3145815001MaRDI QIDQ2161263

Sara Sabrina Zemljič, Andreas M. Hinz, Caroline Holz auf der Heide

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.03.002

zbMATH Keywords

algorithmeccentricitygraph distanceSierpiński graphSierpiński triangle graph

Mathematics Subject Classification ID

Fractals (28A80) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Global strong defensive alliances of Sierpiński-like graphs
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• A survey and classification of Sierpiński-type graphs
• The hub number of Sierpiński-like graphs
• Hamming dimension of a graph-the case of Sierpiński graphs
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• The average distance on the Sierpiński gasket
• Metric properties of Sierpiński-like graphs
• The average eccentricity of Sierpiński graphs
• The Hanoi graph \(H_4^3\)
• Constructing uniform central graphs and embedding into them
• Distances in Sierpiński graphs and on the Sierpiński gasket
• Open problems for Hanoi and Sierpiński graphs
• Feedback vertex number of Sierpiński-type graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• The Tower of Hanoi – Myths and Maths

This page was built for publication: Metric properties of Sierpiński triangle graphs