Precious metal sequences and Sierpiński-type graphs
zbMATH Open1494.05038MaRDI QIDQ5094080FDOQ5094080
Authors: Andreas M. Hinz, Paul K. Stockmeyer
Publication date: 2 August 2022
Full work available at URL: https://cs.uwaterloo.ca/journals/JIS/VOL25/Hinz/hinz5.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Fibonacci numberinteger sequencedistance in graphsPell numberSierpiński graphself-generating setSierpiński triangle graph
Distance in graphs (05C12) Structural characterization of families of graphs (05C75) Combinatorics on words (68R15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- The average distance on the Sierpiński gasket
- On the Fibonacci \(k\)-numbers
- The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Title not available (Why is that?)
- A survey and classification of Sierpiński-type graphs
- The Lichtenberg sequence
- Self-generating sets, integers with missing blocks, and substitutions
- An exploration of sequence A000975
- Metric properties of Sierpiński triangle graphs
- Discovering Fibonacci numbers, Fibonacci words, and a Fibonacci fractal in the tower of Hanoi
- Cyclotomic points and algebraic properties of polygon diagonals
Cited In (1)
Uses Software
This page was built for publication: Precious metal sequences and Sierpiński-type graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094080)