Related papers: Algebraic Graph Theory
We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family,…
We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
This manuscript synthesizes almost fifteen years of research in algebraic combinatorics, in order to highlight, theme by theme, its perspectives. In part one, building on my thesis work, I use tools from commutative algebra, and in…
The family of generalized Paley graphs of prime power order $q$ and degree $(q-1)/k$ is studied. It is shown that the automorphism group of a graph in this family is a subgroup of ${\mathrm{A\Gamma L}}(1,q)$ whenever $q$ is sufficiently…
When the theory of Leavitt path algebras was already quite advanced, it was discovered that some of the more difficult questions were susceptible to a new approach using topological groupoids. The main result that makes this possible is…
The topological symmetry group $\mathrm{TSG}(\Gamma)$ of an embedding $\Gamma$ of a graph in $S^3$ is the subgroup of the automorphism group of the graph which is induced by homeomorphisms of $(S^3,\Gamma)$. If we restrict to orientation…
In this paper we extend the idea of integration to generic algebras. In particular we concentrate over a class of algebras, that we will call self-conjugated, having the property of possessing equivalent right and left multiplication…
We consider the graph whose vertex set is a conjugacy class ${\mathcal C}$ consisting of finite-rank self-adjoint operators on a complex Hilbert space $H$. The dimension of $H$ is assumed to be not less than $3$. In the case when operators…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian. We will discuss basic properties including cohomology and Hodge theory. The main feature of our approach is…
An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
Let $\mathcal{L}$ be a finite-dimensional semisimple Lie algebra of rank $N$ over an algebraically closed field of characteristic $0$. Associated to $\mathcal{L}$ is a family of polynomial folding maps…
This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…
The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…
We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…
The Hoffman program with respect to any real or complex square matrix $M$ associated to a graph $G$ stems from A. J. Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs less than…