Related papers: Distance cube polynomials of Fibonacci and Lucas-r…
Riordan arrays, denoted by pairs of generating functions (g(z), f(z)), are infinite lower-triangular matrices that are used as combinatorial tools. In this paper, we present Riordan and stochastic Riordan arrays that have connections to the…
Daisy cubes are a recently introduced class of isometric subgraphs of hypercubes $Q_n$. They are induced with intervals between chosen vertices of $Q_n$ and the vertex $0^n\in V(Q_n)$. In this paper we characterize daisy cubes in terms of…
We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…
The property of preserving the convexity and concavity of the Bernstein polynomial and of the B\'{e}zier curves is used to generate a method of approximating the reliability polynomial of a hammock network. The mutual behaviour of the…
We present the first truly subcubic, combinatorial algorithm for detecting an induced $4$-cycle in a graph. The running time is $O(n^{2.84})$ on $n$-node graphs, thus separating the task of detecting induced $4$-cycles from detecting…
We continue our study on relationships between Bernoulli polynomials and balancing (Lucas-balancing) polynomials. From these polynomial relations, we deduce new combinatorial identities with Fibonacci (Lucas) and Bernoulli numbers.…
In our previous paper, Real Polynomials with a Complex Twist [see http://archives.math.utk.edu/ICTCM/VOL28/A040/paper.pdf], we used advancements in computer graphics that allow us to easily illustrate more complete graphs of polynomial…
We study a recursively defined two-parameter family of graphs which generalize Fibonacci cubes and Pell graphs and determine their basic structural and enumerative properties. In particular, we show that all of them are induced subgraphs of…
We show that every $(n,d,\lambda)$-graph contains a Hamilton cycle for sufficiently large $n$, assuming that $d\geq \log^{6}n$ and $\lambda\leq cd$, where $c=\frac{1}{70000}$. This significantly improves a recent result of Glock, Correia…
In this paper, new families of generalized Fibonacci and Lucas numbers are introduced. In addition, we present the recurrence relations and the generating functions of the new families for $k=2$.
We define and investigate a new three-parameter family of graphs that further generalizes the Fibonacci and metallic cubes. Namely, the number of vertices in this family of graphs satisfies Horadam recurrence, a linear recurrence of second…
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
The Fibonacci cube of dimension n, denoted as $\Gamma\_n$, is the subgraph of the hypercube induced by vertices with no consecutive 1's. The irregularity of a graph G is the sum of |d(x)-d(y)| over all edges {x,y} of G. In two recent paper…
We introduce the notion of Fibonacci and Lucas derivations of the polynomial algebras and prove that any element of kernel of the derivations defines a polynomial identity for the Fibonacci and Lucas polynomials. Also, we prove that any…
The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…