ǂA ǂnew characterization and a recognition algorithm of Lucas cubes

Povzetek

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.

Ključne besede

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

Podatki

Jezik:	Angleški jezik
Leto izida:	2013
Tipologija:	1.01 - Izvirni znanstveni članek
Organizacija:	UM FNM - Fakulteta za naravoslovje in matematiko
UDK:	519.17
COBISS:	20090376
ISSN:	1365-8050
Št. ogledov:	827
Št. prenosov:	107
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

Sekundarni jezik:	Slovenski jezik
Sekundarne ključne besede:	teorija grafov;Lucasove kocke;karakterizacija;algoritem prepoznavanja;
URN:	URN:SI:UM:
Vrsta dela (COBISS):	Znanstveno delo
Strani:	str. 31-39
Letnik:	ǂVol. ǂ15
Zvezek:	ǂno. ǂ3
Čas izdaje:	2013
ID:	10847392