Shortest paths in Sierpiński graphs

DOI10.1016/j.dam.2013.08.029zbMath1297.05123OpenAlexW2038964955MaRDI QIDQ741754

Bing Xue, Guang-Hui Wang, Lian-Cui Zuo, Guo Jun Li

Publication date: 12 September 2014

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

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

zbMATH Keywords

shortest pathSierpiński graphalmost-extreme vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (9)

Sierpiński products of r-uniform hypergraphs ⋮ The Sierpiński product of graphs ⋮ An efficient algorithm to determine all shortest paths in Sierpiński graphs ⋮ Projective equivalences of \(k\)-neighbourly polytopes ⋮ On distances in generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Structural properties of subdivided-line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring Hanoi and Sierpiński graphs
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• The hub number of Sierpiński-like graphs
• Hamming dimension of a graph-the case of Sierpiński graphs
• On the planarity of Hanoi graphs
• The diameter of Hanoi graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Shortest paths between regular states of the Tower of Hanoi
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• Error-correcting codes on the Towers of Hanoi graphs
• The tower of Hanoi
• The average eccentricity of Sierpiński graphs
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• The Tower of Hanoi – Myths and Maths
• Coloring and Counting on the Tower of Hanoi Graphs
• The complexity of an optimal algorithm for the generalized tower of hanoi problem
• Towers of hanoi graphs
• A statistical analysis of the towers of hanoi problem
• Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
• 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
• Pascal's Triangle and the Tower of Hanoi
• Crossing numbers of Sierpiński‐like graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: Shortest paths in Sierpiński graphs