A characterization of non-isometric binary words
From MaRDI portal
Publication:2422216
DOI10.1016/j.ejc.2019.02.001zbMath1412.68178OpenAlexW2915437750WikidataQ128322838 ScholiaQ128322838MaRDI QIDQ2422216
Jianxin Wei, Xue-Na Zhu, Yujun Yang
Publication date: 18 June 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2019.02.001
Related Items (9)
Words that almost commute ⋮ Quaternary \(n\)-cubes and isometric words ⋮ Checking whether a word is Hamming-isometric in linear time ⋮ Isometric words based on swap and mismatch distance ⋮ Hypercubes and isometric words based on swap and mismatch distance ⋮ Proof of a conjecture on 2-isometric words ⋮ Fibonacci and Lucas \(p\)-cubes ⋮ Circular embeddability of isometric words ⋮ On \(k\)-ary \(n\)-cubes and isometric words
Cites Work
- Unnamed Item
- 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
- The self-concatenation of isometric strings is isometric
- All good (bad) words consisting of 5 blocks
- Infinite families of 2-isometric and not 3-isometric binary words
- On median nature and enumerative properties of Fibonacci-like cubes
- Generalized fibonacci cubes are mostly hamiltonian
This page was built for publication: A characterization of non-isometric binary words