Related papers: Pseudocyclic association schemes and strongly regu…
In 2011, Penttila and Williford constructed an infinite new family of primitive $Q$-polynomial 3-class association schemes, not arising from distance regular graphs, by exploring the geometry of the lines of the unitary polar space…
An association scheme is called partially metric if it has a connected relation whose distance-two relation is also a relation of the scheme. In this paper we determine the symmetric partially metric association schemes with a multiplicity…
We construct a pair of non-commutative rank 8 association schemes from a rank 3 non-symmetric association scheme. For the pair, two association schemes have the same character table but different Frobenius-Schur indicators. This situation…
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
For a given symmetric association scheme $\mathcal{A}$ and its eigenspace $S_j$ there exists a mapping of vertices of $\mathcal{A}$ to unit vectors of $S_j$, known as the spherical representation of $\mathcal{A}$ in $S_j$, such that the…
For any positive integer $m$, the complete graph on $2^{2m}(2^m+2)$ vertices is decomposed into $2^m+1$ commuting strongly regular graphs, which give rise to a symmetric association scheme of class $2^{m+2}-2$. Furthermore, the…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
It is well-known that the cohomology of symmetric quandles generates robust cocycle invariants for unoriented classical and surface links. Expanding on the recently introduced module-theoretic generalized cohomology for symmetric quandles,…
It is well-known that the pancake graphs are widely used as models for interconnection networks \cite{Akers}. In this paper, some properties of the pancake graphs are investigated. We first prove that the pancake graph, denoted by $P_n…
In this paper, we give a characterization of the class of all circular-arc graphs whose schemes are association. Moreover, all association schemes which are the scheme of a circular-arc graph are characterized, specially it is proved that…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…
Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…
Accidental symmetries in effective field theories can be established by computing and comparing Hilbert series. This invites us to study them with the tools of invariant theory. Applying this technology, we spotlight three classes of…
The group $PGL(2,q)$ has an embedding into $PGL(3,q)$ such that it acts as the group fixing a nonsingular conic in $PG(2,q)$. This action affords a coherent configuration $R(q)$ on the set $L(q)$ of non-tangent lines of the conic. We show…
This article initiates a geometric study of the automorphism groups of general graph products of groups, and investigates the algebraic and geometric structure of automorphism groups of cyclic product of groups. For a cyclic product of at…
Most existing semi-supervised graph-based clustering methods exploit the supervisory information by either refining the affinity matrix or directly constraining the low-dimensional representations of data points. The affinity matrix…
This paper studies a discrete homotopy theory for graphs introduced by Barcelo et al. We prove two main results. First we show that if $G$ is a graph containing no 3- or 4-cycles, then the $n$th discrete homotopy group $A_n(G)$ is trivial…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…