On strongly regular graphs
Strongly regular graphs are regular graphs with the additional property that the number of common neighbours for two vertices depends only on whether the vertices are adjacent or non-adjacent. From an algebraic point of view, a graph is strongly regular if its adjacency matrix has exactly three eig...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2009
|
| Online Access: | http://spectrum.library.concordia.ca/976720/1/NR63369.pdf Behbahani, Majid <http://spectrum.library.concordia.ca/view/creators/Behbahani=3AMajid=3A=3A.html> (2009) On strongly regular graphs. PhD thesis, Concordia University. |