[DMO] Ferdinand Ihringer : Some methods for modifying strongly regular graphs
03 May 2023 14:00 till 15:00 - Location: EEMCS Lecture Hall G | Add to my calendar
A graph is called strongly regular with parameters (v, k, \lambda, \mu) if it has v vertices, each vertex has degree k, two adjacent vertices have precisely \lambda common neighbors, and two nonadjacent vertices have precisely \mu common neighbors. We will discuss a few ways of modifying a strongly regular graph such that one obtains more strongly regular graphs with the same parameters.
A graph is called strongly regular with parameters \((v, k, \lambda, \mu)\) if it has \(v\) vertices, each vertex has degree \(k\), two adjacent vertices have precisely \(\lambda\) common neighbors, and two nonadjacent vertices have precisely \(\mu\) common neighbors. We will discuss a few ways of modifying a strongly regular graph such that one obtains more strongly regular graphs with the same parameters.