If f is a binary word and d a positive integer, then the generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all the vertices that contain f as a factor, while the generalized Lucas cube Qd( ↽Ð f ) is the graph obtained from Qd by removing all the vertices that have a circulation containing f as a factor. The Fibonacci cube Γd and the Lucas cube Λd are the grap...

In this paper, hyper-Fibonacci and hyper-Lucas polynomials are defined some of their algebraic combinatorial properties such as the recurrence relations, summation formulas, generating functions presented. addition, relationships between given.

In this article, we survey the recent literature surrounding geometry of complex polynomials. Specific areas surveyed are (i) Generalizations Gauss–Lucas Theorem, (ii) Geometry Polynomials Level Sets, and (iii) Shape Analysis Conformal Equivalence.

This note is dedicated to Professor Gould. The aim is to show how the identities in his book ”Combinatorial Identities” can be used to obtain identities for Fibonacci and Lucas polynomials. In turn these identities allow to derive a wealth of numerical identities for Fibonacci and Lucas numbers.

Let f be a binary string and d C 1. Then the generalized Lucas cube Qd(JÐf ) is introduced as the graph obtained from the d-cube Qd by removing all vertices that have a circulation containing f as a substring. The question for which f and d, the generalized Lucas cube Qd(JÐf ) is an isometric subgraph of the d-cube Qd is solved for all binary strings of length at most five. Several isometricall...

The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of paths and cycles, respectively. In the first part of the work we provide a formula for the number of edges of the Hasse diagram of the independent sets of the h power of a path ordered by inclusion. For h = 1 such a diagram is called a Fibonacci cube, and for h > 1 we obtain a generalization of th...