Name
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). |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.disc.2010.10.005 | Discrete Mathematics |
Keywords | Field | DocType |
strongly regular graph,automorphism | Prime (order theory),Random regular graph,Discrete mathematics,Strongly regular graph,Combinatorics,Two-graph,Vertex (geometry),Automorphism,Regular graph,Strongly regular graphs,Mathematics | Journal |
Volume | Issue | ISSN |
311 | 2-3 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.52 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Majid Behbahani | 1 | 7 | 1.37 |
| Clement Lam | 2 | 59 | 9.25 |