We present a complete description of strongly regular graphs admitting a distance-transitive group of automorphisms. Parts of the list have already appeared in the literature; however, this is the first
time that the complete list appears in one place. The description is complemented, where possible, with the discussion of the corresponding distance-transitive groups and some further properties of the graphs. We also point out an open problem.
Distance-transitive strongly regular graphs
Alfuraidan, Monther Rashed
Full PDF
carpathian_2022_38_1_21_34Additional Information
| Author(s) | Alfuraidan, Monther Rashed |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2022.01.03 |
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration