Related papers: Graph Immersions, Inverse Monoids, and Deck Transf…

Given an oriented immersed hypersurface in hyperbolic space $\mathbb{H}^{n+1}$, its Gauss map is defined with values in the space of oriented geodesics of $\mathbb{H}^{n+1}$, which is endowed with a natural para-K\"ahler structure. In this…

Every Hadamard matrix $H$ of order $n > 1$ induces a graph with $4n$ vertices, called the Hadamard graph $\Gamma(H)$ of $H$. Since $\Gamma(H)$ is a distance-regular graph with diameter $4$, it induces a $4$-class association scheme…

For an integer $s\geq1$ and a graph $\Gamma$, a path $(u_0, u_1, \ldots, u_{s})$ composed of vertices of $\Gamma$ is called an {\em $s$-geodesic} if it is a shortest path between $u_0$ and $u_s$. We say that $\Gamma$ is {\em $s$-geodesic…

Let $G$ be a group, $F$ a field, and $A$ a finite-dimensional central simple algebra over $F$ on which $G$ acts by $F$-algebra automorphisms. We study the ideals and subalgebras of $A$ which are preserved by the group action. Let $V$ be the…

Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown…

Let G be a finite group acting orthogonally on a pair (S^d,\Gamma) where \Gamma is a finite, connected graph of genus g>1 embedded in the sphere S^d. The 3-dimensional case d=3 has recently been considered in a paper by C. Wang, S. Wang, Y.…

For an integer $s\geq1$ and a graph $\Gamma$, a path $(u_0, u_1, \ldots, u_{s})$ of vertices of $\Gamma$ is called an {\em $s$-geodesic} if it is a shortest path from $u_0$ to $u_{s}$. We say that $\Gamma$ is {\em $s$-geodesic transitive}…

We study the complexity of graph modification problems with respect to homomorphism-based colouring properties of edge-coloured graphs. A homomorphism from edge-coloured graph $G$ to edge-coloured graph $H$ is a vertex-mapping from $G$ to…

We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…

Let $N$ be a closed nonorientable surface with or without marked points. In this paper we prove that, for every finite full subgraph $\Gamma$ of $\mathcal{C}^{\mathrm{two}}(N)$, the right-angled Artin group on $\Gamma$ can be embedded in…

For a fixed "pattern" graph $G$, the $\textit{colored $G$-subgraph isomorphism problem}$ (denoted $\mathrm{SUB}(G)$) asks, given an $n$-vertex graph $H$ and a coloring $V(H) \to V(G)$, whether $H$ contains a properly colored copy of $G$.…

Higher-rank graph generalisations of the Popescu-Poisson transform are constructed, allowing us to develop a dilation theory for higher rank operator tuples. These dilations are joint dilations of the families of operators satisfying…

Immersion minor is an important variant of graph minor, defined through an injective mapping from vertices in a smaller graph $H$ to vertices in a larger graph $G$ where adjacent elements of the former are connected in the latter by…

Let $\Gamma$ be a f.g. discrete group and let $\tilde M$ be a Galois $\Gamma$-covering of a smooth closed manifold $M$. Let $S_*^\Gamma(\tilde{M})$ be the analytic structure group, appearing in the Higson-Roe analytic surgery sequence $\to…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

An immersion of a graph $H$ in a graph $G$ is a minimal subgraph $I$ of $G$ for which there is an injection ${{\rm i}} \colon V(H) \to V(I)$ and a set of edge-disjoint paths $\{P_e: e \in E(H)\}$ in $I$ such that the end vertices of…

A graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected…

We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…