<?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://dirros.openscience.si/IzpisGradiva.php?id=18629"><dc:title>Generalized Pell graphs</dc:title><dc:creator>Iršič Chenoweth,	Vesna	(Avtor)
	</dc:creator><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Tan,	Elif	(Avtor)
	</dc:creator><dc:subject>Fibonacci cubes</dc:subject><dc:subject>Pell graphs</dc:subject><dc:subject>generating functions</dc:subject><dc:subject>center of graph</dc:subject><dc:subject>median graphs</dc:subject><dc:subject>k-Fibonacci sequence</dc:subject><dc:description>In this paper, generalized Pell graphs $\Pi_{n,k}$, $k\ge 2$, are introduced. The special case of $k=2$ are the Pell graphs $\Pi_{n}$ defined earlier by Munarini. Several metric, enumerative, and structural properties of these graphs are established. The generating function of the number of edges of $\Pi_{n,k}$ and the generating function of its cube polynomial are determined. The center of $\Pi_{n,k}$ is explicitly described; if $k$ is even, then it induces the Fibonacci cube $\Gamma_{n}$. It is also shown that $\Pi_{n,k}$ is a median graph, and that $\Pi_{n,k}$ embeds into a Fibonacci cube.</dc:description><dc:date>2023</dc:date><dc:date>2024-04-08 10:25:37</dc:date><dc:type>Neznano</dc:type><dc:identifier>18629</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
