A survey and classification of Sierpiński-type graphs (Q516890): Difference between revisions

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

Latest revision as of 12:56, 13 July 2024

scientific article
Language Label Description Also known as
English
A survey and classification of Sierpiński-type graphs
scientific article

    Statements

    A survey and classification of Sierpiński-type graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    Sierpiński triangle
    0 references
    Sierpiński graphs
    0 references
    Hanoi graphs
    0 references
    graph distance
    0 references
    domination in graphs
    0 references
    graph colorings
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers