Related papers: Generalized Pell graphs

A new family of generalized Pell numbers was recently introduced and studied by Br\'od \cite{Dorota}. These number possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of generalized Pell numbers can…

In this paper we enumerate the parameter matrices of all perfect 2-colorings of the generalized Petersen graphs GP(n;3), where n>=7. We also give some basic results for GP(n; k).

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Hager before 1985. As its a natural counterpart, we introduced the concept of generalized edge-connectivity $\lambda_k(G)$, recently. In this paper we summarize…

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…

Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…

The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $\Gamma^{(p)}_n$, which are subgraphs of $Q_n$ induced by…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized…

For each positive integer $n$, the Fibonacci-sum graph $G_n$ on vertices $1,2,\ldots,n$ is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each $G_n$ is bipartite, and all Hamiltonian…

The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is a generalization of the traditional connectivity. It is well known that the generalized $k$-connectivity is an important indicator for measuring the fault…

The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may…

Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…

For an integer $k\ge 2$, let $\{F^{(k)}_{n}\}_{n\ge 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms. In…

The $d$-Fibonacci digraphs $F(d,k)$, introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their…

Using the properties of generalized Fibonacci numbers, we determine the automorphism groups of some K3 surfaces with Picard number 2. Conversely, using the automorphisms of K3 surfaces with Picard number 2, we prove the criterion for a…

A multi-graph $G$ on $n$ vertices is $(k,\ell)$-sparse if every subset of $n'\leq n$ vertices spans at most $kn'- \ell$ edges. $G$ is {\em tight} if, in addition, it has exactly $kn - \ell$ edges. For integer values $k$ and $\ell \in [0,…

This study examines the properties of an r-circulant matrix whose entries are defined by the generalized k-Pell-Tribonacci sequence {P_k,n}. Explicit expressions are derived for the Frobenius (Euclidean) norm and the entrywise \ell_1-norm,…

Let $p, k, q$ be positive integers with $p-2 \geqslant k$ and let $K_{p,k}^{q}$ be the generalized pineapple graph which is obtained by joining independent set of $q$ vertices with $k$ vertices of a complete graph $K_{p}.$ In \cite{TSH2},…

In this paper we give a new generalization of token graphs. Given two integers $1\leq m \leq k$ and a graph $G$ we define the generalized token graph of the graph $G$, to be the graph $F_k^m(G)$ whose vertices correspond to configurations…

In this paper, we give some determinantal and permanental representations of Generalized Fibonacci Polynomials by using various Hessenberg matrices. These results are general form of determinantal and permanental representations of k…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…