Skip to Main content Skip to Navigation
Journal articles

A new characterization and a recognition algorithm of Lucas cubes

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, March 26, 2014 - 3:16:22 PM
Last modification on : Thursday, September 7, 2017 - 1:03:49 AM
Long-term archiving on: : Thursday, June 26, 2014 - 11:31:27 AM


Files produced by the author(s)




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. ⟨10.46298/dmtcs.617⟩. ⟨hal-00966379⟩



Record views


Files downloads