All good (bad) words consisting of 5 blocks
From MaRDI portal
Publication:2403998
DOI10.1007/s10114-017-6134-2zbMath1369.05058OpenAlexW2572852521MaRDI QIDQ2403998
Publication date: 12 September 2017
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-017-6134-2
Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
The self-concatenation of isometric strings is isometric ⋮ 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
- 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
- The observability of the Fibonacci and the Lucas cubes
- Structural and enumerative properties of the Fibonacci cubes
- 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
- Recursive fault-tolerance of Fibonacci cube in hypercubes
- On median nature and enumerative properties of Fibonacci-like cubes
- Generalized fibonacci cubes are mostly hamiltonian
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: All good (bad) words consisting of 5 blocks
