1. M. Behbahani, On strongly regular graphs, Ph.D. Thesis, Concordia University, 2009.
2. A (49, 16, 3, 6) strongly regular graph does not exist;Bussemaker;European J. Combin.,1989
3. Designs, graphs, codes and their links;Cameron;London Math. Soc. Stud. Texts,1991
4. The CRC Handbook of Combinatorial Designs,2006
5. Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes;Coolsaet;Electron. J. Combin.,2008