On \(k\)-ary \(n\)-cubes and isometric words
From MaRDI portal
Publication:2089690
DOI10.1016/j.tcs.2022.10.007OpenAlexW4306154916MaRDI QIDQ2089690
Manuela Flores, Marcella Anselmo, Marina Madonia
Publication date: 24 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.007
Related Items (2)
Isometric words based on swap and mismatch distance ⋮ Hypercubes and isometric words based on swap and mismatch distance
Cites Work
- The structures of bad words
- 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
- Circular embeddability of isometric words
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
- A survey of the theory of hypercube graphs
- On \(k\)-ary \(n\)-cubes: Theory and applications.
- Structure of Fibonacci cubes: a survey
- Bad pictures: some structural properties related to overlaps
- Quaternary \(n\)-cubes and isometric words
- Proof of a conjecture on 2-isometric words
- A characterization of non-isometric binary words
- Lee distance and topological properties of k-ary n-cubes
This page was built for publication: On \(k\)-ary \(n\)-cubes and isometric words