Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Munarini graphs: a generalization of Fibonacci cubes and Pell graphs. Part I

View through CrossRef
The Fibonacci cube Γn is the subgraph of the hypercube Qn induced by vertices with no consecutive 1s. Munarini introduced Pell graphs, a variation of Fibonacci cubes defined on ternary strings.  A generalization of  Pell graphs to (k+1)-ary strings has recently been proposed. In this paper we introduce Munarini graphs, which constitute an alternative  generalization of Fibonacci cubes and  Pell graphs. One of the main advantages of Munarini graphs is that, unlike previously proposed generalization, they are daisy cubes, as are Fibonacci cubes and  Pell graphs. In this first article, we  study some of their fundamental properties including the size, the recursive structure,  the cube  and  maximal cube polynomials.
Elsevier BV
Title: Munarini graphs: a generalization of Fibonacci cubes and Pell graphs. Part I
Description:
The Fibonacci cube Γn is the subgraph of the hypercube Qn induced by vertices with no consecutive 1s.
Munarini introduced Pell graphs, a variation of Fibonacci cubes defined on ternary strings.
  A generalization of  Pell graphs to (k+1)-ary strings has recently been proposed.
In this paper we introduce Munarini graphs, which constitute an alternative  generalization of Fibonacci cubes and  Pell graphs.
One of the main advantages of Munarini graphs is that, unlike previously proposed generalization, they are daisy cubes, as are Fibonacci cubes and  Pell graphs.
In this first article, we  study some of their fundamental properties including the size, the recursive structure,  the cube  and  maximal cube polynomials.

Related Results

Fibonacci Prime Labelling on the Class of Flower Graphs
Fibonacci Prime Labelling on the Class of Flower Graphs
Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...
On Hybrid Hyper k-Pell, k-Pell–Lucas, and Modified k-Pell Numbers
On Hybrid Hyper k-Pell, k-Pell–Lucas, and Modified k-Pell Numbers
Many different number systems have been the topic of research. One of the recently studied number systems is that of hybrid numbers, which are generalizations of other number syste...
Some Binomial Sums of k-Pell, k-Pell-Lucas and Modified k-Pell Numbers
Some Binomial Sums of k-Pell, k-Pell-Lucas and Modified k-Pell Numbers
The main goal of this paper is to find some new identities containing k-Pell and k-Pell-Lucas numbers. In addition, we use these identities to prove binomial properties of k-Pell, ...
On generalized (k, r)-Pell and (k, r)-Pell–Lucas numbers
On generalized (k, r)-Pell and (k, r)-Pell–Lucas numbers
We introduce new kinds of k-Pell and k-Pell–Lucas numbers related to the distance between numbers by a recurrence relation and show their relation to the (k,r)-Pell and (k,r)-Pell–...
Some Properties of the Fibonacci Sequence
Some Properties of the Fibonacci Sequence
The purposes of this paper are; (a) to develop a relationship between subscripts of the symbols of Fibonacci and Lucas numbers and the numbers themselves; (b) to develop relationsh...
The Properties of the Altered Pell and Pell Lucas Sequences
The Properties of the Altered Pell and Pell Lucas Sequences
The altered Pell and Pell Lucas sequences are defined by altering the Pell and Pell Lucas numbers, it is seen that they have similar properties to usual the Pell and Pell Lucas seq...
Diophantine equations for additive Pell numbers in Pell, Pell–Lucas, and Modified Pell numbers
Diophantine equations for additive Pell numbers in Pell, Pell–Lucas, and Modified Pell numbers
This paper investigates the Diophantine equations arising from ternary additive problems of Pell, Pell–Lucas, and Modified Pell numbers. Specifically, we characterize all integer s...

Back to Top