Abstract : Fibonacci and Lucas cubes are induced subgraphs of hypercubes obtained by excluding certain binary strings from the vertex set. They appear as models for interconnection networks, as well as in chemistry. We derive a characterization of Lucas cubes that is based on a peripheral expansion of a unique convex subgraph of an appropriate Fibonacci cube. This serves as the foundation for a recognition algorithm of Lucas cubes that runs in linear time.
https://hal.inria.fr/hal-00966379
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Submitted on : Wednesday, March 26, 2014 - 3:16:22 PM
Last modification on : Thursday, September 7, 2017 - 1:03:49 AM
Document(s) archivé(s) le : Thursday, June 26, 2014 - 11:31:27 AM
Andrej Taranenko. A new characterization and a recognition algorithm of Lucas cubes. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 3 (3), pp.31--39. 〈hal-00966379〉
