The structures of bad words

DOI10.1016/j.ejc.2016.05.003zbMath1348.05143OpenAlexW2409804675MaRDI QIDQ326667

Jianxin Wei

Publication date: 12 October 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2016.05.003

zbMATH Keywords

binary word

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

Words that almost commute ⋮ Quaternary \(n\)-cubes and isometric words ⋮ 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 ⋮ Checking whether a word is Hamming-isometric in linear time ⋮ Isometric words based on swap and mismatch distance ⋮ A characterization of non-isometric binary words ⋮ Hypercubes and isometric words based on swap and mismatch distance ⋮ Proof of a conjecture on 2-isometric words ⋮ Circular embeddability of isometric words ⋮ On \(k\)-ary \(n\)-cubes and isometric words

Cites Work

• Unnamed Item
• Unnamed Item
• Solution to a conjecture on words that are bad and 2-isometric
• 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
• Structure of Fibonacci cubes: a survey
• The degree sequence of Fibonacci and Lucas cubes
• On the Wiener index of generalized Fibonacci cubes and Lucas cubes
• Linear recognition and embedding of Fibonacci cubes
• Fast recognition of 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

This page was built for publication: The structures of bad words