TITLE: What graph parameters are determined by parameters for strongly regular graph
QUESTION [7 upvotes]: Say two graphs are not isomorphic but are both strongly regular with the same set of parameters.  Are there any parameters (other than the usual such as order, degrees, eigenvalues and multiplicities, etc.) that are determined, e.g., independence number, chromatic number, etc.?
Thanks for any help

REPLY [3 votes]: The number of cycles of length 3,4,5 are determined.  If the girth is 4, the number of 6-cycles is determined too.