Connectivity and some other properties of generalized Sierpiński graphs

DOI10.2298/AADM170206009KzbMath1488.05283OpenAlexW2804122818MaRDI QIDQ5155718

Sandi Klavžar, Sara Sabrina Zemljič

Publication date: 8 October 2021

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

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

zbMATH Keywords

connectivityHamiltonian graph1-factoredge-connectivitygeneralized Sierpiński graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

The Sierpiński product of graphs ⋮ Resolvability and convexity properties in the Sierpiński product of graphs ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ Degree sequence of the generalized Sierpiński graph ⋮ Recognizing generalized Sierpiński graphs ⋮ Irregular colorings of certain classes of corona product and Sierpiński graphs

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Counting the number of perfect matchings in \(K_{5}\)-free graphs
• A survey and classification of Sierpiński-type graphs
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Enumeration of matchings in families of self-similar graphs
• A new proof that 4-connected planar graphs are Hamiltonian-connected
• Dimer coverings on the Sierpinski gasket
• Exact and asymptotic enumeration of perfect matchings in self-similar graphs
• On generalized Sierpiński graphs
• LIPSCHITZ EQUIVALENCE OF TOTALLY DISCONNECTED GENERAL SIERPINSKI TRIANGLES
• The Tower of Hanoi – Myths and Maths
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• On the roman domination number of generalized Sierpiński graphs
• On distances in generalized Sierpiński graphs
• Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
• The strong metric dimension of generalized Sierpiński graphs with pendant vertices
• The clone cover
• Isometries in Normed Spaces
• Dimer–monomer model on the Towers of Hanoi graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata
• Inequalities: theory of majorization and its applications

This page was built for publication: Connectivity and some other properties of generalized Sierpiński graphs