On the existence of cycles of every even length on generalized Fibonacci cubes
Keywords:
Fibonacci numbers, Boolean cube, Hamiltonian cycleAbstract
A new topology for the interconnection of computing nodes in multiprocessors systems is the generalized Fibonacci cube.
It can be embedded as a subgraph in the Boolean cube and it is also a supergraph of other structures. We prove that every edge of such a graph, but few initial cases, belongs to cycles of every even length.
Downloads
Published
Issue
Section
License
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.