Monthly Archives: August 2014

Strongly regular graphs

A graph is called regular if its every vertex has the same number of neighbours. For example, this is a regular graph where each vertex has exactly three neighbours: It is the well known Petersen graph which is so important and popular in graph … Continue reading

Posted in Combinatorics | Tagged | 3 Comments