Related papers: Pseudocyclic association schemes and strongly regu…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

We introduce a concept of cyclotomic association scheme C over a finite near-field. It is proved that if C is nontrivial, then Aut(C)<AGL(V) where V is the linear space associated with the near-field. In many cases we are able to get more…

A connected symmetric graph of prime valency is {\em basic} if its automorphism group contains no nontrivial normal subgroup having more than two orbits. Let $p$ be a prime and $n$ a positive integer. In this paper, we investigate…

Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…

Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…

For a graph \(G\), let $avm(G)$ denote the average size of its maximal matchings. This parameter was introduced by Engbers and Erey in the study of extremal problems for maximal matchings, and they asked for extensions from trees and…

The computational cost of micromechanics for heterogeneous materials can be reduced in certain cases where symmetric boundary conditions are applicable. We derived an eighth symmetric formulation of the Generalized Method of Cells for…

We investigate the convex hulls of the eight dihedral symmetry classes of $n \times n$ alternating sign matrices, i.e., ASMs invariant under a subgroup of the symmetry group of the square. Extending the prefix-sum description of the ASM…

We consider the size and structure of the automorphism groups of a variety of empirical `real-world' networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric. We relate automorphism…

This paper studies the problem of detecting anomalous graphs using a machine learning model trained on only normal graphs, which has many applications in molecule, biology, and social network data analysis. We present a self-discriminative…

This paper provides a further step in our program of studying superconformal nets over S^1 from the point of view of noncommutative geometry. For any such net A and any family Delta of localized endomorphisms of the even part A^gamma of A,…

We study Hamiltonicity and pancyclicity in the graph obtained as the union of a deterministic $n$-vertex graph $H$ with $\delta(H)\geq\alpha n$ and a random $d$-regular graph $G$, for $d\in\{1,2\}$. When $G$ is a random $2$-regular graph,…

Supersymmetry provides a natural playground for the construction of dynamically constrained lattice fermion models. We here illustrate how supersymmetry can be used to construct a fermionic equivalent of the PXP model with an adjustable…

We explore some connections between association schemes and the analyses of the semidefinite programming (SDP) based convex relaxations of combinatorial optimization problems in the Lov\'{a}sz--Schrijver lift-and-project hierarchy. Our…

This note provides an introduction to selected topics in algebraic graph theory, including strongly regular graphs, Steiner systems, and automorphism groups. We describe constructions and properties of notable graphs such as the Petersen…

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for…

Let $(X,\mathcal{R})$ be a commutative association scheme and let $\Gamma=(X,R\cup R^\top)$ be a connected undirected graph where $R\in \mathcal{R}$. Godsil (resp., Brouwer) conjectured that the edge connectivity (resp., vertex…

Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…