A survey and classification of Sierpiński-type graphs

DOI10.1016/j.dam.2016.09.024zbMath1358.05219OpenAlexW2529495091MaRDI QIDQ516890

Sara Sabrina Zemljič, Sandi Klavžar, Andreas M. Hinz

Publication date: 15 March 2017

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

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

zbMATH Keywords

Sierpiński graphsHanoi graphsgraph distancegraph coloringsdomination in graphsSierpiński triangle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Italian domination and perfect Italian domination on Sierpiński graphs, On generalized Sierpiński graphs, Packing coloring of Sierpiński-type graphs, Relating the outer-independent total Roman domination number with some classical parameters of graphs, The Sierpiński product of graphs, The median of Sierpiński graphs, Metric properties of Sierpiński triangle graphs, Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs, Open problems for Hanoi and Sierpiński graphs, On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs, Power domination in Knödel graphs and Hanoi graphs, A survey on packing colorings, The Hanoi graph \(H_4^3\), Resolvability and convexity properties in the Sierpiński product of graphs, Security in Sierpiński graphs, On the AVDTC of Sierpiński-type graphs, The Graovac-Pisanski index of Sierpiński graphs, Minimum Linear Arrangement of Generalized Sierpinski Graphs, Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\), On distances in generalized Sierpiński graphs, Connectivity and some other properties of generalized Sierpiński graphs, Grundy dominating sequences and zero forcing sets, Unnamed Item, Metric properties of generalized Sierpiński graphs over stars, Unnamed Item, Strong geodetic problem in networks, Valency-based topological descriptors and structural property of the generalized Sierpiński networks, Degree sequence of the generalized Sierpiński graph, Some algebraic properties of Sierpiński-type graphs, Graph automaton groups, Recognizing generalized Sierpiński graphs, On the treewidth of Hanoi graphs, Feedback vertex number of Sierpiński-type graphs, On the roman domination number of generalized Sierpiński graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The outer-connected domination number of Sierpiński-like graphs
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• Global strong defensive alliances of Sierpiński-like graphs
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Coloring Hanoi and Sierpiński graphs
• Generalized power domination of graphs
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• The number of moves of the largest disc in shortest paths on Hanoi graphs
• Coloring the square of Sierpiński graphs
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Enumeration of matchings in families of self-similar graphs
• Weighted spanning trees on some self-similar graphs
• Resistance scaling and the number of spanning trees in self-similar lattices
• 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
• A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
• Weighted codes in Lee metrics
• Shortest paths in Sierpiński graphs
• The number and degree distribution of spanning trees in the Tower of Hanoi graph
• Coloring Sierpiński graphs and Sierpiński gasket graphs
• Complexity of the packing coloring problem for trees
• The hub number of a graph
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Perfect codes over graphs
• Brownian motion on the Sierpinski gasket
• The average distance on the Sierpiński gasket
• The b-chromatic number of a graph
• Global defensive alliances in graphs
• Power domination in Knödel graphs and Hanoi graphs
• 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
• Finding the edge ranking number through vertex partitions
• \(b\)-chromatic number of Cartesian product of some families of graphs
• The linear \(t\)-colorings of Sierpiński-like graphs
• Structural properties of subdivided-line graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• The fourth tower of Hanoi
• New results on variants of covering codes in Sierpiński graphs
• Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
• Perfect codes in graphs
• Packing chromatic number of base-3 Sierpiński graphs
• The Tutte polynomial of the Sierpiński and Hanoi graphs
• Star coloring of subcubic graphs
• The Tower of Hanoi – Myths and Maths
• The Group of Symmetries of the Tower of Hanoi Graph
• Star coloring of graphs
• Base size, metric dimension and other invariants of groups and graphs
• Enumeration of spanning trees on Apollonian networks
• Tutte polynomial of the Apollonian network
• Fractals and Universal Spaces in Dimension Theory
• Schreier spectrum of the Hanoi Towers group on three pegs
• On Isometric Embeddings of Graphs
• Perfect codes on the towers of Hanoi graph
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Rankings of Graphs
• Domination in Graphs Applied to Electric Power Networks
• 1-perfect codes in Sierpiński graphs
• Total Domination in Graphs
• On the roman domination number of generalized Sierpiński graphs
• On distances in generalized Sierpiński graphs
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
• Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
• Characterizing subgraphs of Hamming graphs
• On automorphism groups of graph truncations
• Crossing numbers of Sierpiński‐like graphs
• Dimer–monomer model on the Towers of Hanoi graphs
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees