Circular embeddability of isometric words
From MaRDI portal
Publication:785823
DOI10.1016/j.disc.2020.112024zbMath1445.05072OpenAlexW3035189046MaRDI QIDQ785823
Jianxin Wei, Guangfu Wang, Yujun Yang
Publication date: 12 August 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112024
Combinatorics on words (68R15) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
Quaternary \(n\)-cubes and isometric words ⋮ Hypercubes and isometric words based on swap and mismatch distance ⋮ Fibonacci and Lucas \(p\)-cubes ⋮ On \(k\)-ary \(n\)-cubes and isometric words ⋮ Efficient proper embedding of a daisy cube
Cites Work
- 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
- Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles
- 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
- A characterization of non-isometric binary words
- On median nature and enumerative properties of Fibonacci-like cubes
- Generalized Lucas cubes
- Generalized fibonacci cubes are mostly hamiltonian
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Circular embeddability of isometric words
