Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
From MaRDI portal
Publication:4209980
DOI10.1023/A:1022444205860zbMath0898.05042OpenAlexW1603307171MaRDI QIDQ4209980
Uroš Milutinović, Sandi Klavžar
Publication date: 28 September 1998
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/30349
Related Items
Italian domination and perfect Italian domination on Sierpiński graphs ⋮ Irregularity of Sierpinski graph ⋮ On generalized Sierpiński graphs ⋮ Sierpiński products of r-uniform hypergraphs ⋮ Eccentricity-based topological indices of a cyclic octahedron structure ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ Relating the outer-independent total Roman domination number with some classical parameters of graphs ⋮ A fractal hypernetwork model with good controllability ⋮ The Sierpiński product of graphs ⋮ 1-perfect codes in Sierpiński graphs ⋮ On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs ⋮ A general method for computing Tutte polynomials of self-similar graphs ⋮ Computational solution of an old tower of Hanoi problem ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ The median of Sierpiński graphs ⋮ Metric properties of Sierpiński triangle graphs ⋮ Sierpiński graphs as spanning subgraphs of Hanoi graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ On topological properties of Sierpinski networks ⋮ The average eccentricity of Sierpiński graphs ⋮ Constructions of universalized Sierpiński graphs based on labeling manipulations ⋮ On the general Randić index of polymeric networks modelled by generalized Sierpiński graphs ⋮ An efficient algorithm to determine all shortest paths in Sierpiński graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ A survey on packing colorings ⋮ Resolvability and convexity properties in the Sierpiński product of graphs ⋮ Security in Sierpiński graphs ⋮ Total colorings-a survey ⋮ On the AVDTC of Sierpiński-type graphs ⋮ The Graovac-Pisanski index of Sierpiński graphs ⋮ Minimum Linear Arrangement of Generalized Sierpinski Graphs ⋮ Finding the edge ranking number through vertex partitions ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ Unnamed Item ⋮ The hub number of Sierpiński-like graphs ⋮ Metric properties 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 ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ The Wiener index of Sierpiński-like graphs ⋮ On distances in generalized Sierpiński graphs ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Grundy dominating sequences and zero forcing sets ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Unnamed Item ⋮ The linear \(t\)-colorings of Sierpiński-like graphs ⋮ Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ Structural properties of subdivided-line graphs ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ The \((d, 1)\)-total labelling of Sierpiński-like graphs ⋮ Strong geodetic problem in networks ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ Shortest paths in Sierpiński graphs ⋮ Degree sequence of the generalized Sierpiński graph ⋮ Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets ⋮ Dynamics of hierarchical weighted networks of van der Pol oscillators ⋮ Some algebraic properties of Sierpiński-type graphs ⋮ Vertex-, edge-, and total-colorings of Sierpiński-like graphs ⋮ On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs ⋮ Recognizing generalized Sierpiński graphs ⋮ Unnamed Item ⋮ The double Roman domination number of generalized Sierpiński graphs ⋮ Italian domination on Mycielskian and Sierpinski graphs ⋮ Irregular colorings of certain classes of corona product and Sierpiński graphs ⋮ Feedback vertex number of Sierpiński-type graphs ⋮ On the roman domination number of generalized Sierpiński graphs ⋮ The outer-connected domination number of Sierpiński-like graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Finding the prime factors of strong direct product graphs in polynomial time
- An analysis of the generalized Towers of Hanoi problem
- Isometric embeddings in Hamming graphs
- Shortest paths between regular states of the Tower of Hanoi
- Associative products of graphs
- The average distance on the Sierpiński gasket
- The tower of Hanoi
- Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
- On Imbedding Finite-Dimensional Metric Spaces
- Quasi‐median graphs and algebras
- Pascal's Triangle and the Tower of Hanoi
