Related papers: Codes and Designs in Johnson Graphs From Symplecti…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

We propose a novel graph visualization method leveraging random walk-based embeddings to replace costly graph-theoretical distance computations. Using word2vec-inspired embeddings, our approach captures both structural and semantic…

Kirchhoff-type Laws for signed graphs are characterized by generalizing transpedances through the incidence-oriented structure of bidirected graphs. The classical $2$-arborescence interpretation of Tutte is shown to be equivalent to…

We provide an abundance of strongly regular graphs (SRGs) for certain parameters $(n, k, \lambda, \mu)$ with $n < 100$. For this we use Godsil-McKay (GM) switching with a partition of type $4,n-4$ and Wang-Qiu-Hu (WQH) switching with a…

In this paper, we study the graph induced by the $\textit{2-swap}$ permutation on words with a fixed Parikh vector. A $2$-swap is defined as a pair of positions $s = (i, j)$ where the word $w$ induced by the swap $s$ on $v$ is $v[1] v[2]…

Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A vertex…

In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case…

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

Given their potential for fault-tolerant operations, topological quantum states are currently the focus of intense activity. Of particular interest are topological quantum error correction codes, such as the surface and planar stabilizer…

We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective constant. To do this, we introduce the skeleton $X_{G,S}$ of…

This paper investigates the \textbf{graphical $r$-Stirling numbers of the first kind}, denoted by $\str{G}{k}$, which enumerate partitions of a vertex set $V(G)$ into $k$ disjoint cycles such that $r$ specified vertices occupy distinct…

Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…

The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-stab}(n, k)$ is obtained from the Kneser graph by deleting vertices with…

Let $V$ be an $n$-dimensional left vector space over a division ring $R$. We write ${\mathcal G}_{k}(V)$ for the Grassmannian formed by $k$-dimensional subspaces of $V$ and denote by $\Gamma_{k}(V)$ the associated Grassmann graph. Let also…

Given any triplet of positive integers $n \geq 2$, $m$ and $k$ such that $n=m+k$, we exhibit a $C^1$ robustly transitive endomorphism of $\mathbb{T}^n$ with persistent critical points in the isotopy class of $F \times Id$, where $F$ is an…

A ${\rm{TS}}(v,\lambda)$ is a pair $(V,\mathcal{B})$ where $V$ contains $v$ points and $\mathcal{B}$ contains $3$-element subsets of $V$ so that each pair in $V$ appears in exactly $\lambda$ blocks. A $2$-block intersection graph ($2$-BIG)…

A code $C$ in a generalised quadrangle ${\mathcal Q}$ is defined to be a subset of the vertex set of the point-line incidence graph $\varGamma$ of ${\mathcal Q}$. The minimum distance $\delta$ of $C$ is the smallest distance between a pair…

The Schreier graphs of Thompson's group F with respect to the stabilizer of 1/2 and generators x_0 and x_1, and of its unitary representation in L_2([0,1]) induced by the standard action on the interval [0,1] are explicitly described. The…

In this paper we determine all locally finite and symmetric actions of a group on the tree of valency five. As a corollary we complete the classification of the isomorphism types of vertex and edge stabilisers in a group acting…