Related papers: Symplectic Graphs and Their Automorphisms
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…
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…
In 1968, Erd\"os defined the Shift Graph as the graph whose vertices are the $k$-element subsets of $[n]=\{0,1,2,...,n-1\}$ such that $A=\{a_1,...,a_k\}$ and $B=\{b_1,...,b_k\}$ are neighbours iff $a_1<b_1=a_2<b_2=a_3<... <b_{n-1}=a_n<b_n$.…
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of…
We classify non symplectic prime order automorphisms and all finite order symplectic automorphism groups of generalised Kummer fourfolds using lattice theory and recent results on ample cones and monodromy groups. We study various geometric…
We study the effect of diagram automorphisms on rank-level duality. We use it to prove new symplectic rank-level dualities on genus zero smooth curves with marked points and chosen coordinates. We also show that rank-level dualities for the…
In this paper, we study the automorphism group and geodesic transitivity of a family of vertex-transitive graphs $H(n,k)$, introduced by Fu-Tao Hu \textit{et.al.} in 2010. In the process, we address some naturally arising, unanswered…
We study the local symplectic algebra of curves with semigroups $(4,5,6,7)$, $(4,5,6)$ and $(4,5,7)$. We use the method of algebraic restrictions to parameterized curves as in \cite{D1}. A new discrete invariant for algebraic restrictions…
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 article, we derive and discuss the properties of the symplectic group Sp(2), which arises in Hamiltonian dynamics and ray optics. We show that a symplectic matrix can be written as the product of a symmetric dilation matrix and a…
We give a combinatorial characterization of the group of quasiconformal homeomorphisms of a closed, oriented surface $S$ of genus at least $2$. In particular, we prove they are exactly the automorphisms of a graph of essential quasicircles…
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
The main goal of the paper is to characterize new classes of multicone graphs which are determined by both adjacency and Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. A wheel graph obtained…
The graph $G$ is said to be strongly regular with parameters $(n,k,\lambda,\mu)$ if the following conditions hold: (1) each vertex has $k$ neighbours; (2) any two adjacent vertices of $G$ have $\lambda$ common neighbours; (3) any two…
In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group $O^+(6,2)$ or $O^-(6,2)$. Consequently, we prove the existence of strongly regular graphs with…
We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
We consider simple loopless finite undirected graphs. Such a graph is called strongly regular with parameter set (v,k,l,m), for short a srg(v,k,l,m), iff it has exactly v vertices, each of them has exactly k neighbours, and the number of…
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,…