The median of Sierpiński graphs
From MaRDI portal
Publication:2161247
DOI10.1016/j.dam.2021.02.005zbMath1494.05031MaRDI QIDQ2161247
Andreas M. Hinz, Manoj Changat, Kannan Balakrishnan, Divya Sindhu Lekha
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.02.005
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- The average eccentricity of Sierpiński graphs
- The Hanoi graph \(H_4^3\)
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- The Tower of Hanoi – Myths and Maths
- On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension