English
Related papers

Related papers: Transitive regular $q$-analogs of graphs

200 papers

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

Combinatorics · Mathematics 2014-05-28 Svante Janson , Vera T. Sós

A few years ago, the concept of a D-analogue was introduced as a Dirichlet series analogue for the already known and well researched hypergeometric q-series. The D-analogue of the q-Dixon sum is given here, in the context of seeing a direct…

Number Theory · Mathematics 2013-02-13 Geoffrey B Campbell

We carry the argument used in the proof of the Theorem of Denjoy over to the quasiperiodically forced case. Thus we derive that if a system of quasiperiodically forced circle diffeomorphisms with bounded variation of the derivative has no…

Dynamical Systems · Mathematics 2007-05-23 Tobias H. Jaeger , Gerhard Keller

A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if $G$ is normal in $\Aut\Ga$. The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the…

Combinatorics · Mathematics 2017-02-21 Bo Ling , Ben Gong Lou

In this paper, we establish a q-analog of partial fraction decomposition formula. By using formula, we develop new closed form representations of sums of q-harmonic numbers and reciprocal q-binomial coefficients. Moreover, we give explicit…

Number Theory · Mathematics 2017-10-24 Ce Xu

We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.

Quantum Physics · Physics 2015-06-26 Gregor Tanner

The $Q$-polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit the $Q$-polynomial property. Only recently the $Q$-polynomial…

Combinatorics · Mathematics 2024-04-22 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo

In this paper we construct structures from Mathieu group $M_{11}$. We classify transitive $t$-designs with 11, 12 and 22 points admitting a transitive action of Mathieu group $M_{11}$. Thereby we proved the existence of designs with…

Combinatorics · Mathematics 2017-06-20 Dean Crnkovic , Andrea Svob

This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.

Combinatorics · Mathematics 2025-05-28 Sergio G. Gómez-Galicia , Octavio B. Zapata-Fonseca

As an extension to the Laplace and Sumudu transforms the classical Natural transform was proposed to solve certain fluid flow problems. In this paper, we investigate q-analogues of the q-Natural transform of some special functions. We…

Classical Analysis and ODEs · Mathematics 2015-10-05 S. K. Q. Al-Omari , A. Kilicman

We extend the notion of an $H$-normal quotient digraph of an $H$-vertex-transitive digraph to that of an $H$-subnormal quotient digraph. Using these concepts, together with bipartite halves of bipartite digraphs, we show that, for each…

Combinatorics · Mathematics 2025-12-22 Lei Chen , Cheryl Praeger

We construct the q-analogue of Euler-Barnes' numbers and polynomials, and investigate their some properties.

Number Theory · Mathematics 2007-05-23 Taekyun Kim , Lee-Chae Jang

In the present article, we introduce a $(p,q)$-analogue of the poly-Euler polynomials and numbers by using the $(p,q)$-polylogarithm function. These new sequences are generalizations of the poly-Euler numbers and polynomials. We give…

Number Theory · Mathematics 2016-04-14 Takao Komatsu , José L. Ramírez , Víctor F. Sirvent

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,…

Combinatorics · Mathematics 2015-11-09 Chris Godsil , Krystal Guo , Tor G. J. Myklebust

Let $\Gamma$ denote a finite, undirected, connected graph, with vertex set $X$. Fix a vertex $x \in X$. Associated with $x$ is a certain subalgebra $T=T(x)$ of ${\rm Mat}_X(\mathbb C)$, called the subconstituent algebra. The algebra $T$ is…

Combinatorics · Mathematics 2017-10-18 Paul Terwilliger , Arjana Žitnik

The study of locally s-distance transitive graphs initiated by the authors in previous work, identified that graphs with a star quotient are of particular interest. This paper shows that the study of locally s-distance transitive graphs…

Combinatorics · Mathematics 2013-08-05 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

Deza digraphs were introduced in 2003 by Zhang and Wang as directed graph version of Deza graphs, that also generalize the notion of directed strongly regular graphs. In this paper we give several new constructions of Deza digraphs.…

Combinatorics · Mathematics 2020-06-09 Dean Crnkovic , Hadi Kharaghani , Sho Suda , Andrea Svob

In this paper we construct distance-regular graphs admitting a transitive action of the five sporadic simple groups discovered by E. Mathieu, the Mathieu groups $M_{11}$, $M_{12}$, $M_{22}$, $M_{23}$ and $M_{24}$. From the code spanned by…

Combinatorics · Mathematics 2021-03-09 Dean Crnkovic , Nina Mostarac , Andrea Svob

We describe the relationships between the notion of $q$-deformed rational numbers, introduced in our previous work with Sophie Morier-Genoud, and the theory of dimer models. We show that $q$-deformed rationals can be calculated in terms of…

Combinatorics · Mathematics 2025-10-21 Valentin Ovsienko

In the $m$-dimensional affine space $AG(m,q)$ over the finite field $\mathbb{F}_q$ of odd order $q$, the analogous of the Euclidean distance gives rise to a graph $\mathfrak{G}_{m,q}$ where vertices are the points of $AG(m,q)$ and two…

Combinatorics · Mathematics 2021-02-08 Gábor Korchmáros , Federico Romaniello , Tamás Szőnyi