Andrej Taranenko - A new characterization and a recognition algorithm of Lucas cubes

dmtcs:617 - Discrete Mathematics & Theoretical Computer Science, October 2, 2013, Vol. 15 no. 3 - https://doi.org/10.46298/dmtcs.617
A new characterization and a recognition algorithm of Lucas cubesArticle

Authors: Andrej Taranenko ORCID1

  • 1 Faculty of Natural Sciences and Mathematics [Maribor]

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.


Volume: Vol. 15 no. 3
Section: Graph Theory
Published on: October 2, 2013
Accepted on: June 9, 2015
Submitted on: June 16, 2012
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Consultation statistics

This page has been seen 397 times.
This article's PDF has been downloaded 514 times.