<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=66782"><dc:title>Linear recognition of generalized Fibonacci cubes $Q_h (111)$</dc:title><dc:creator>Rho,	Yoomi	(Avtor)
	</dc:creator><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:subject>graph theory</dc:subject><dc:subject>Fibonacci cubes</dc:subject><dc:subject>recognition algorithm</dc:subject><dc:description>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.</dc:description><dc:publisher> Discrete Mathematics &amp; Theoretical Computer Science</dc:publisher><dc:date>2016</dc:date><dc:date>2017-07-10 11:40:59</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>66782</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
