Strongly Regular Graphs
In graph theory, a strongly regular graph (SRG) is a regular graph with vertices and Degree (graph theory), degree such that for some given integers \lambda, \mu \ge 0 * every two adjacent vertices have common neighbours, and * every two non-adjacent vertices have common neighbours. Such a strongly regular graph is denoted by . Its complement graph is also strongly regular: it is an . A strongly regular graph is a distance-regular graph with diameter 2 whenever μ is non-zero. It is a locally linear graph whenever . Etymology A strongly regular graph is denoted as an srg(''v'', ''k'', λ, μ) in the literature. By convention, graphs which satisfy the definition trivially are excluded from detailed studies and lists of strongly regular graphs. These include the disjoint union of one or more equal-sized complete graphs, and their complement graph, complements, the complete multipartite graphs with equal-sized independent sets. Andries Brouwer and Hendrik van Maldeghem (see ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]