Jeroen M. van Rijckevorsel

  • Citations Per Year
Learn More
For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these codes for some families of graphs, we pay attention to the relation between the codes of switching equivalent graphs and, with the exception of two parameter sets, we generate by computer the codes of all known strongly regular(More)
  • 1