Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

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.
Fichier principal
Vignette du fichier
2192-8357-1-PB.pdf (132) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00966379 , version 1 (26-03-2014)

Identifiers

Cite

Andrej Taranenko. A new characterization and a recognition algorithm of Lucas cubes. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 3 (3), pp.31--39. ⟨10.46298/dmtcs.617⟩. ⟨hal-00966379⟩

Collections

TDS-MACS
134 View
1331 Download

Altmetric

Share

More