Generalized Pell graphs

Abstract

In this paper, generalized Pell graphs n,k, k 2, are introduced. The special case of k=2 are the Pell graphs 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 n,k and the generating function of its cube polynomial are determined. The center of n,k is explicitly described; if k is even, then it induces the Fibonacci cube n. It is also shown that n,k is a median graph, and that n,k embeds into a Fibonacci cube.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…