Related papers: Distance cube polynomials of Fibonacci and Lucas-r…
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and…
We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some known identities involving Fibonacci numbers such as…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…
We study a family of graphs related to the $n$-cube. The middle cube graph of parameter $k$ is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube…
The main contribution of this paper is a six-step semi-automatic algorithm that obtains a recursion satisfied by a family of determinants by systematically and iteratively applying Laplace expansion to the underlying matrix family. The…
In this paper we develop an algorithm for obtaining some new linear relations among the Lauricella $F_D$ functions. Relations we obtain, generalize those hinted in the work of B. C. Carlson. The coefficients of these relations are contained…
We evaluate some types of infinite series with balancing and Lucas-balancing polynomials in closed form. These evaluations will lead to some new curious series for $\pi$ involving Fibonacci and Lucas numbers. Our findings complement those…
As graphical summaries for topological spaces and maps, Reeb graphs are common objects in the computer graphics or topological data analysis literature. Defining good metrics between these objects has become an important question for…
In this paper we provide a large family of rank-metric codes, which contains properly the codes recently found by Longobardi and Zanella (2021) and by Longobardi, Marino, Trombetti and Zhou (2021). These codes are…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
Inspired by the split decomposition of graphs and rank-width, we introduce the notion of $r$-splits. We focus on the family of $r$-splits of a graph of order $n$, and we prove that it forms a hypergraph with several properties. We prove…
We give a characterization of distance--preserving subgraphs of Johnson graphs, i.e. of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph $J(m,\Lambda)$ has the subsets of cardinality $m$ of a set $\Lambda$ as…
We continue our study on relationships between Fibonacci (Lucas) numbers and Bernoulli numbers and polynomials. The derivations of our results are based on functional equations for the respective generating functions, which in our case are…
For every pair of vertices u and v with d(u; v) = n, Wun G v denotes the set of all vertices of G that are closer to u than to v. In this paper, we introduce quasi-({\lambda}; n)-distance-balanced graphs and then study some properties of…
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…
In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…
Some well-known results of Prodinger and Tichy are that the number of independent sets in the $n$-vertex path graph is $F_{n+2}$, and that the number of independent sets in the $n$-vertex cycle graph is $L_n$. We generalize these results by…
The neighborhood polynomial of graph $G$, denoted by $N(G,x)$, is the generating function for the number of vertex subsets of $G$ which are subsets of open neighborhoods of vertices in $G$. For any graph polynomial, it can be useful to…
We will prove that some weighted graphs on the distance $k$-graph of hypercubes approximate the $q$-Hermite polynomial of a $q$-gaussian variable by providing an appropriate matrix model.
In this paper, we define the incomplete h(x)-Fibonacci and h(x)-Lucas polynomials, we study recurrence relations and some properties of these polynomials