progress(3)

1: try to run the program done by ah fu on MATLAB, prof has done n=4 on MAPLE and that is his limit, must try to out-do him
Lucky got "divine help"on this one

2: define an association scheme for my graph...should be an analog to the Johnson graph(scheme)

3: go find out any results i can use on symmetric groups and then project it down onto my graph

P.S: proof on eigenvector for smallest eigenvalue of graph has been done