The self-concatenation of isometric strings is isometric
From MaRDI portal
Publication:2397527
DOI10.1016/j.disc.2017.03.018zbMath1362.05043OpenAlexW2607046692MaRDI QIDQ2397527
Jianxin Wei, Yujun Yang, Guangfu Wang
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.03.018
Related Items (4)
Infinite families of 2-isometric and not 3-isometric binary words ⋮ A characterization of non-isometric binary words ⋮ Proof of a conjecture on 2-isometric words ⋮ Circular embeddability of isometric words
Cites Work
- Unnamed Item
- Unnamed Item
- The structures of bad words
- Parity index of binary words and powers of prime words
- Solution to a conjecture on words that are bad and 2-isometric
- On isomorphism classes of generalized Fibonacci cubes
- Proofs of two conjectures on generalized Fibonacci cubes
- Asymptotic number of isometric generalized Fibonacci cubes
- Generalized Fibonacci cubes
- The index of a binary word
- Structure of Fibonacci cubes: a survey
- On the Wiener index of generalized Fibonacci cubes and Lucas cubes
- A negative answer to a problem on generalized Fibonacci cubes
- All good (bad) words consisting of 5 blocks
- On median nature and enumerative properties of Fibonacci-like cubes
- Generalized fibonacci cubes are mostly hamiltonian
This page was built for publication: The self-concatenation of isometric strings is isometric