A new characterization and a recognition algorithm of Lucas cubes

9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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. © 2013 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France.

Cite

CITATION STYLE

APA

Taranenko, A. (2013). A new characterization and a recognition algorithm of Lucas cubes. Discrete Mathematics and Theoretical Computer Science, 15(3), 31–40. https://doi.org/10.46298/dmtcs.617

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free