相关论文: Transitive regular $q$-analogs of graphs

In 1987, Andrews and Baxter introduced six kinds of $q$-trinomial coefficients in exploring the solution of a model in statistical mechanics. In this paper, we give some $q$-supercongruences for the truncated forms of these polynomials.

Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…

In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different…

We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of $S^+(U^3)$, a matrix based on the amplitudes of walks in the quantum walk,…

A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…

In this paper we define the generalized q-analogues of Euler sums and present a new family of identities for q-analogues of Euler sums by using the method of Jackson q-integral rep- resentations of series. We then apply it to obtain a…

This work makes a parallel construction for curves on threefolds to a ``current-theoretic'' proof of Abel's theorem giving the rational equivalence of divisors P and Q on a Riemann surface when Q - P is (equivalent to) zero in the Jacobian…

A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…

We provide combinatorial as well as probabilistic interpretations for the q-analogue of the Pochhammer k-symbol introduced by Diaz and Teruel. We introduce q-analogues of the Mellin transform in order to study the q-analogue of the k-gamma…

In this paper we introduce a $(p, q)$-deformed analogues of the generalized Touchard polynomials and Stirling numbers, the post-quantum analogues of the $q$-deformed generalized Touchard polynomials and Stirling numbers. The connection…

In this paper, we define the quotinet graphs. In particular, we introduce the boundary quotient graphs, admissible boundary quotient graphs and subgraph boundary qoutient graphs. By the property of the quotient spaces, the boundary…

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…

The concept of directed strongly regular graphs was introduced by Duval in his paper, A Directed Graph Version of Strongly Regular Graphs. Duval also provided several construction methods for directed strongly regular graphs. The directed…

In 1988, Duval introduced the concept of directed strongly regular graphs, which can be viewed as a directed graph version of strongly regular graphs. Such directed graphs have similar structural and algebraic properties to strongly regular…

We consider an analogue of the well-known Riemann Hypothesis based on quantum walks on graphs with the help of the Konno-Sato theorem. Furthermore, we give some examples for complete, cycle, and star graphs.

For each positive rational number $\epsilon$, we define $K$-theoretic $\epsilon$-stable quasimaps to certain GIT quotients $W\sslash G$. For $\epsilon>1$, this recovers the $K$-theoretic Gromov-Witten theory of $W\sslash G$ introduced in…

The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is…

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) =…

Traditional graph analysis focuses on nodes and edges, that is, pairwise relationships. Yet many real-world networks, including biological, social, and communication networks, involve higher-order relationships in which multiple nodes…

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…