Related papers: Transitive regular $q$-analogs of graphs
While studying gradient dynamical systems (DSs), Morse introduced the idea of encoding the qualitative behavior of a DS into a graph. Smale later refined Morse's idea and extended it to Axiom-A diffeomorphisms on manifolds. In Smale's…
In a simple graph, a shunt is a symmetry which sends an edge to an incident edge (without fixing their shared vertex). The orbit of this edge under the shunt forms a consistent cycle. The important theorem of Biggs and Conway says that in a…
We present a multivariable generalization of the digital binomial theorem from which a q-analog is derived as a special case.
Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a…
We construct a subalgebra of the Hecke algebra of type A. This is a generalization of the group algebra of the alternating groups. All the equivalent classes of irreducible representations of the subalgebra and the q-analogue of the…
This paper was inspired by a paper by Blokhuis and Brouwer [Designs, Codes and Cryptography 65, 2012] in which a definition of a graph on the flags of a biplane is given, and they prove that the graph corresponding to the unique…
In this paper we introduce and study a type of Cayley graph -- subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph $K_{p^d,p^d}$ with $p$…
We give a $q$-analog of middle convolution for linear $q$-difference equations with rational coefficients. In the differential case, middle convolution is defined by Katz, and he examined properties of middle convolution in detail. In this…
In connection with cluster algebras, snake graphs and q-integers, Kyungyong Lee and Ralf Schiffler recently found a formula for computing the (normalized) Jones polynomials of rational links in terms of continued fraction expansion of…
A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or…
A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples.…
The connection between q-analogs of special functions and representations of quantum algebras has been developed recently. It has led to advances in the theory of q-special functions that we here review.
The Gilbert graph $\text{Gilbert}(q,n,d)$, which arises naturally in graph theory and coding theory, is the regular graph on $\mathbb{F}_q^n$ in which two vertices are adjacent if their Hamming distance is less than $d$, and it is…
In this paper we discuss a relationship between the following two algebras: (i) the subconstituent algebra $T$ of a distance-regular graph that has $q$-Racah type; (ii) the $q$-tetrahedron algebra $\boxtimes_q$ which is a $q$-deformation of…
We introduce quantum association schemes. This allows to define distance regular and strongly regular quantum graphs. We bring examples thereof. In addition, we formulate the duality for translation quantum association schemes corresponding…
Distance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we…
There is a type of distance-regular graph, said to be $Q$-polynomial. In this paper we investigate a generalized $Q$-polynomial property involving a graph that is not necessarily distance-regular. We give a detailed description of an…
Based on ideas of K\"otter and Kschischang we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in Braun, Kerber and Laue as a…
Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…
A half-arc-transitive graph is a regular graph that is both vertex- and edge-transitive, but is not arc-transitive. If such a graph has finite valency, then its valency is even, and greater than $2$. In 1970, Bouwer proved that there exists…