Related papers: Finite 2-geodesic transitive graphs of prime valen…

We review the nearly complete classification project for finite distance-transitive graphs and compile a list of all known graphs. Interestingly, we find that those graphs with diameter larger than 4, apart from a small finite number of…

We study covering graphs of the Paley graph associated to a finite field of characteristic p in the case where the covering transformation group is cyclic of prime order distinct from p. When the field has q = p elements, we show that the…

A subgroup of the automorphism group of a graph $\G$ is said to be {\em half-arc-transitive} on $\G$ if its action on $\G$ is transitive on the vertex set of $\G$ and on the edge set of $\G$ but not on the arc set of $\G$. Tetravalent…

We show that the isometry group of a finite-volume hyperbolic 3-manifold acts simply transitively on many of its closed geodesics. Combining this observation with the Virtual Special Theorems of the first author and Wise, we show that every…

We consider a family of 2-step nilpotent Lie algebras associated to uniform complete graphs on odd number of vertices. We prove that the symmetry group of such a graph is the holomorph of the additive cyclic group $\Z_n$. Moreover, we prove…

If $p$ is prime, a compact Riemann surface $X$ of genus $g\geq 2$ is called cyclic $p$-gonal if it admits a cyclic group of automorphisms $C_{p}$ of order $p$ such that the quotient space $X/C_{p}$ has genus 0. If in addition $C_{p}$ is not…

We prove that if $\Gamma$ is a finite connected vertex-transitive cubic graph, then either $|V\Gamma| \le 90$, or $\Gamma$ is a split Praeger--Xu graph, or there exist two vertices $\alpha$ and $\beta$ such that the identity is the only…

The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…

An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…

Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the arc-type of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex…

One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open case.

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, $4$-valent one-regular graphs of order $5p^2$, where $p$ is a prime, are classified

A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph…

We describe computational results about undirected graphs having $14$ vertices and automorphism group isomorphic to $\mathbb{Z}/8\mathbb{Z}$, graphs $\Gamma$ which have less than $2|Aut(\Gamma)|$ vertices. We give one example of such…

In 2018 the first, Rukavina and the third author constructed with the aid of a computer the first example of a strongly regular graph $\Gamma$ with parameters (216, 40, 4, 8) and proved that it is the unique PSU(4,2)-invariant…

In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using…

We prove that for every prime $p$ algebraically clean graphs of groups are virtually residually $p$-finite and cohomologically $p$-complete. We also prove that they are cohomologically good. We apply this to certain $2$-dimensional Artin…

Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…

For a finite group $G$, the prime graph $\Gamma(G)$ (also known as Gruenberg-Kegel graph) is defined to be the graph where the vertices are the primes that divide $|G|$ such that two vertices $p$ and $q$ share an edge if and only if there…

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…