Strongly regular graphs with non-trivial automorphisms |
| |
Authors: | Majid Behbahani Clement Lam |
| |
Institution: | Department of Computer Science and Software Engineering, Concordia University, 1455 De Maisonneuve W., Montréal, Québec, Canada H3G 1M8 |
| |
Abstract: | The possible existence of 16 parameter sets for strongly regular graphs with 100 or less vertices is still unknown. In this paper, we outline a method to search for strongly regular graphs by assuming a non-trivial automorphism of prime order. Among these unknown parameter sets, we eliminated many possible automorphisms, but some small prime orders still remain. We also found 6 new strongly regular graphs with parameters (49,18,7,6). |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|