3 search results - page 1 / 1 » Strongly regular graphs with non-trivial automorphisms |
DM
2011
12 years 12 months ago
2011
COMBINATORICS
2006
13 years 4 months ago
2006
Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with ...
EJC
2006
13 years 4 months ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...