The topic of this thesis are strongly regular graphs. The thesis is divided into four sections and an appendix. In the first section, the goal is to get acquainted with the definition of a strongly regular graph and the basic conditions that apply. We give examples of some strongly regular graphs and their parameters. Pictures of the graphs accompany the contents of the first section. In the second section we study the spectrum of strongly regular graphs. We find formulae for the multiplicity of their eigenvalues, which must be integers. This result is referred to as the integrality condition, and provides a powerful non-existence criterion for strongly regular graphs. In the third section two further existence criteria for strongly regular graphs are presented: the absolute bound and the Krein conditions. In the fourth section all of the previous results about strongly regular graphs are put to use. The goal is to make a table of admissible parameters \((v,k,\lambda,\mu)\) satisfying the necessary conditions from the first section and the integrality condition. We compare our table with A. E. Brouwer’s table of strongly regular graphs, and find that it contains exactly the same parameters for \(v \leq 50\). Information about the existence and the number of strongly regular graphs is also given. The appendix contains code in the computer algebra system Maxima we used to make the table of admissible parameters of strongly regular graphs.