Related papers: Cayley Graphs on Billiard Surfaces, and Their Genu…

Let $p$ be an odd prime, and $D_{2p}=\langle \tau,\sigma\mid \tau^p=\sigma^2=e,\sigma\tau\sigma=\tau^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we provide the number of (connected) Cayley (di-)graphs on $D_{2p}$ up to…

Let $G$ be a group. The BCI problem asks whether two Haar graphs of $G$ are isomorphic if and only if they are isomorphic by an element of an explicit list of isomorphisms. We first generalize this problem in a natural way and give a…

We consider classical billiards on surfaces of constant curvature, where the charged billiard ball is exposed to a homogeneous, stationary magnetic field perpendicular to the surface. We establish sufficient conditions for hyperbolicity of…

We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…

A thrackle is a drawing of a graph on a surface such that (i) adjacent edges only intersect at their common vertex; and (ii) nonadjacent edges intersect at exactly one point, at which they cross. Conway conjectured that if a graph with $n$…

We present a finer quantitative version of an observation due to Breuillard, Green, Guralnick and Tao which tells that for finite non-bipartite Cayley graphs, once the nontrivial eigenvalues of their normalized adjacency matrices are…

It is well-known that a nonsingular minimal cubic surface is birationally rigid; the group of its birational selfmaps is generated by biregular selfmaps and birational involutions such that all relations between the latter are implied by…

We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.

For any finite group $G$, a natural question to ask is the order of the smallest possible automorphism group for a Cayley graph on $G$. A particular Cayley graph whose automorphism group has this order is referred to as an MRR (Most Rigid…

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

We study the unitary Cayley graph of a matrix semiring. We find bounds for its diameter, clique number and independence number, and determine its girth. We also find the relationship between the diameter and the clique number of a unitary…

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…

This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A(\Gamma)$ is singular. The singularity of graphs is of certain interest in graph theory and algebraic combinatorics. Here we…

The signature of a surface bundle over a surface is known to be divisible by 4. It is also known that the signature vanishes if the fiber genus is less than or equal to 2 or the base genus is less than or equal to 1. In this article, we…

In this note we construct an infinite-dimensional Lie group structure on the group of vertical bisections of a regular Lie groupoid. We then identify the Lie algebra of this group and discuss regularity properties (in the sense of Milnor)…

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.

In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous…

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…