相关论文: Transitive regular $q$-analogs of graphs
A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…
In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined…
One must add arrows which are forced by transitivity to form the transitive closure of a directed graph. We introduce a construction of a transitive directed graph which is formed by adding vertices instead of arrows and which preserves the…
Two graphs $G$ and $H$ are \emph{cospectral} if the adjacency matrices share the same spectrum. Constructing cospectral non-isomorphic graphs has been studied extensively for many years and various constructions are known in the literature,…
We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
Universal cycles, such as De Bruijn cycles, are cyclic sequences of symbols that represent every combinatorial object from some family exactly once as a consecutive subsequence. Graph universal cycles are a graph analogue of universal…
Assume that $\nu$ is a positive integer and $\delta=0, 1$ or $2$. In this paper we introduce the orthogonal graph $\Gamma^{2\nu+\delta}$ over a Galois ring of odd characteristic and prove that it is arc transitive. Moreover, we compute its…
We investigate the computationally hard problem whether a random graph of finite average vertex degree has an extensively large $q$-regular subgraph, i.e., a subgraph with all vertices having degree equal to $q$. We reformulate this problem…
Let $k\ge 1$ be an odd integer, $t=\lfloor {{k+2}\over 4}\rfloor$, and $q$ be a prime power. We construct a bipartite, $q$-regular, edge-transitive graph $C\!D(k,q)$ of order $v \le 2q^{k-t+1}$ and girth $g \ge k+5$. If $e$ is the the…
Frenkel-Reshetikhin introduced $q$-characters of finite dimensional representations of quantum affine algebras. We give a combinatorial algorithm to compute them for all simple modules. Our tool is $t$-analogue of the $q$-characters, which…
Carlitz has introduced an interesting $q$-analogue of Frobenius-Euler numbers in [4]. He has indicated a corresponding Stadudt-Clausen theorem and also some interesting congruence properties of the $q$-Euler numbers. In this paper we give…
In this paper, we consider a $q$-analogue of the Dunkl operator on $\mathbb{R}$, we define and study its associated Fourier transform which is a $q$-analogue of the Dunkl transform. In addition to several properties, we establish an…
Carlitz has introduced q-analogues of the Bernoulli numbers around 1950. We obtain a representation of these q-Bernoulli numbers (and some shifted version) as moments of some orthogonal polynomials. This also gives factorisations of Hankel…
Motivated by the recent research of congruences and $q$-congruences, we provide two different $q$-analogues of the (G.2) supercongruence of Van Hamme through the `creative microscoping' method, which was devised by Guo and Zudilin. It is a…
The additive analogues of Pseudo-Smarandache, Smarandache-simple functions and their duals have been recently studied by J. Sandor. In this note, we obtain q-analogue of Sandor's theorems.
We extend the notion of quasi-transitive orientations of graphs to 2-edge-coloured graphs. By relating quasi-transitive $2$-edge-colourings to an equivalence relation on the edge set of a graph, we classify those graphs that admit a…
We introduce four q-analogs of the double Laplace transform and prove some of their main properties. Next we show how they can be used to solve some q-functional equations and partial q-differential equations.
Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $\Gamma$. For a vertex $x\in X$ and for $0 \leq i \leq D$, let $E^*_i(x)$ denote the projection matrix…
In recent years, new neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse…