On distances in generalized Sierpiński graphs

DOI10.2298/AADM160802001EzbMath1488.05155arXiv1608.00769OpenAlexW2963957200MaRDI QIDQ5155698

Alejandro Estrada-Moreno, Erick David Rodríguez-Bazan, Juan Alberto Rodríguez-Velázquez

Publication date: 8 October 2021

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.00769

zbMATH Keywords

Sierpiński graphsdistances in graphsgeneralized Sierpiński graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

The Sierpiński product of graphs ⋮ Resolvability and convexity properties in the Sierpiński product of graphs ⋮ The Graovac-Pisanski index of Sierpiński graphs ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ Recognizing generalized Sierpiński graphs

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
• Hamming dimension of a graph-the case of Sierpiński graphs
• Shortest paths in Sierpiński graphs
• The average eccentricity of Sierpiński graphs
• On generalized Sierpiński graphs
• New results on variants of covering codes in Sierpiński graphs
• The Tower of Hanoi – Myths and Maths
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• 1-perfect codes in Sierpiński graphs
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
• The strong metric dimension of generalized Sierpiński graphs with pendant vertices

This page was built for publication: On distances in generalized Sierpiński graphs