Recognizing generalized Sierpiński graphs

DOI10.2298/AADM180331003IzbMath1474.05372MaRDI QIDQ4988984

Wilfried Imrich, Iztok Peterin

Publication date: 20 May 2021

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

zbMATH Keywords

algorithmSierpiński graphsgeneralized Sierpiński graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The Sierpiński product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A congruence theorem for trees
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• The tower of Hanoi
• The average eccentricity of Sierpiński graphs
• On generalized Sierpiński graphs
• On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
• The Tower of Hanoi – Myths and Maths
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• Fractals and Universal Spaces in Dimension Theory
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• A solution of the isomorphism problem for circulant graphs
• On the roman domination number of generalized Sierpiński graphs
• On distances in generalized Sierpiński graphs
• Connectivity and some other properties of generalized Sierpiński graphs
• The strong metric dimension of generalized Sierpiński graphs with pendant vertices