Yoomi Rho (Avtor), Aleksander Vesel (Avtor)

Povzetek

The generalized Fibonacci cube $Q_h(f)$ is the graph obtained from the $h$-cube $Q_h$ by removing all vertices that contain a given binary string $f$ as a substring. In particular, the vertex set of the 3rd order generalized Fibonacci cube $Q_h(111)$ is the set of all binary strings $b_1b_2 ... b_h$ containing no three consecutive 1’s. We present a new characterization of the 3rd order generalized Fibonacci cubes based on their recursive structure. The characterization is the basis for an algorithm which recognizes these graphs in linear time.

Ključne besede

teorija grafov;Fibonaccijeve kocke;algoritem prepoznavanja;graph theory;Fibonacci cubes;recognition algorithm;

Podatki

Jezik: Angleški jezik
Leto izida:
Tipologija: 1.01 - Izvirni znanstveni članek
Organizacija: UM FNM - Fakulteta za naravoslovje in matematiko
UDK: 519.17
COBISS: 22599944 Povezava se bo odprla v novem oknu
ISSN: 1365-8050
Št. ogledov: 754
Št. prenosov: 135
Ocena: 0 (0 glasov)
Metapodatki: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Ostali podatki

Sekundarni jezik: Slovenski jezik
Sekundarne ključne besede: teorija grafov;Fibonaccijeve kocke;algoritem prepoznavanja;
URN: URN:SI:UM:
Vrsta dela (COBISS): Znanstveno delo
Strani: str. 349-362
Letnik: ǂVol. ǂ17
Zvezek: ǂno. ǂ3
Čas izdaje: 2016
ID: 10847395