Recognizing generalized Sierpiński graphs

DOI10.2298/AADM180331003IMaRDI QIDQ4988984zbMATH OpenFDO

Authors Wilfried Imrich, Iztok Peterin

Publication date 20 May 2021

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

Full work available at URL https://doi.org/10.2298/AADM180331003I

zbMATH Keywords

algorithmgeneralized Sierpiński graphsSierpiński graphs

Mathematics Subject Classification ID

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

Recommendations

• On distances in generalized Sierpiński graphs
• On generalized Sierpiński graphs
• Connectivity and some other properties of generalized Sierpiński graphs
• A 2-parametric generalization of Sierpiński gasket graphs.
• On some metric properties of the Sierpiński graphs S(n,k)

Cites work

• A congruence theorem for trees
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• A solution of the isomorphism problem for circulant graphs
• A survey and classification of Sierpiński-type graphs
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Connectivity and some other properties of generalized Sierpiński graphs
• Fractals and Universal Spaces in Dimension Theory
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• scientific article; zbMATH DE number 3575612 (Why is no real title available?)
• 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
• On distances in generalized Sierpiński graphs
• On generalized Sierpiński graphs
• On some metric properties of the Sierpiński graphs S(n,k)
• On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs
• On the Randić index of polymeric networks modelled by generalized Sierpiński graphs
• On the roman domination number of generalized Sierpiński graphs
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• The average eccentricity of Sierpiński graphs
• The strong metric dimension of generalized Sierpiński graphs with pendant vertices
• The tower of Hanoi
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• Total coloring for generalized Sierpiński graphs

Cited in

(13)

• Recognition of fractal graphs
• Constructions of universalized Sierpiński graphs based on labeling manipulations
• Recognizing generalized transmission graphs of line segments and circular sectors
• On generalized Sierpiński graphs
• Recognizable series on graphs and hypergraphs
• Some algebraic properties of Sierpiński-type graphs
• A 2-parametric generalization of Sierpiński gasket graphs.
• Sierpinski gasket-based graphs in coding theory
• The Sierpiński product of graphs
• Precious metal sequences and Sierpiński-type graphs
• On distances in generalized Sierpiński graphs
• Connectivity and some other properties of generalized Sierpiński graphs
• The Sierpiński domination number

This page was built for publication: Recognizing generalized Sierpiński graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988984)