ǂ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.

Keywords

teorija grafov;Lucasove kocke;karakterizacija;algoritem prepoznavanja;graph theory;Lucas cubes;characterization;recognition algorithm;

Data

Language:	English
Year of publishing:	2013
Typology:	1.01 - Original Scientific Article
Organization:	UM FNM - Faculty of Natural Sciences and Mathematics
UDC:	519.17
COBISS:	20090376
ISSN:	1365-8050
Views:	827
Downloads:	107
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Slovenian
Secondary keywords:	teorija grafov;Lucasove kocke;karakterizacija;algoritem prepoznavanja;
URN:	URN:SI:UM:
Type (COBISS):	Scientific work
Pages:	str. 31-39
Volume:	ǂVol. ǂ15
Issue:	ǂno. ǂ3
Chronology:	2013
ID:	10847392