• Corpus ID: 119272808

The index of a string consisting of 4 blocks

@article{Wei2015TheIO,
  title={The index of a string consisting of 4 blocks},
  author={Jianxin Wei and Heping Zhang},
  journal={arXiv: Combinatorics},
  year={2015}
}
Generalized Fibonacci cube $Q_{d}(f)$, introduced by Ili\'{c}, Klav\v{z}ar and Rho, is the graph obtained from the $d$-hypercube $Q_{d}$ by removing all vertices that contain $f$ as a substring. The smallest integer $d$ such that $Q_{d}(f)$ is not an isometric subgraph of $Q_{d}$ is called the index of $f$. A non-extendable sequence of contiguous equal digits in a string $\mu$ is called a block of $\mu$. The question that determine the index of a string consisting of at most 3 blocks is solved… 

Tables from this paper

References

SHOWING 1-10 OF 10 REFERENCES
Fibonacci-like cubes as Z-transformation graphs
Asymptotic number of isometric generalized Fibonacci cubes
Structure of Fibonacci cubes: a survey
TLDR
A survey on Fibonacci cubes is given with an emphasis on their structure, including representations, recursive construction, hamiltonicity, degree sequence and other enumeration results, and their median nature that leads to a fast recognition algorithm is discussed.
The index of a binary word
Generalized fibonacci cubes are mostly hamiltonian
TLDR
This work shows that each member of the generalized Fibonacci cubes, which are a new family of graphs that have applications in interconnection topologies, contains a Hamiltonian path.
On the existence of cycles of every even length on generalized Fibonacci cubes
  • N. Salvi
  • Mathematics, Computer Science
  • 1997
TLDR
It is proved that every edge of a generalized Fibonacci cube, but few initial cases, belongs to cycles of every even length.
Fibonacci Cubes-A New Interconnection Technology
  • W. Hsu
  • Computer Science, Mathematics
    IEEE Trans. Parallel Distributed Syst.
  • 1993
A novel interconnection topology called the Fibonacci cube is shown to possess attractive recurrent structures in spite of its asymmetric and relatively sparse interconnections. Since it can be
FIBONACCI CUBES ARE THE RESONANCE GRAPHS OF FIBONACCENES
Fibonacci cubes were introduced in 1993 and intensively studied afterwards. This paper adds the following theorem to these studies: Fibonacci cubes are precisely the resonance graphs of bonaccenes.
Product Graphs: Structure and Recognition
Basic Concepts. Hypercubes. Hamming Graphs. Cartesian Products. Strong and Direct Products. Lexicographic Products. Fast Recognition Algorithms. Invariants. Appendices. Bibliography. Indexes.