In graph theory, a discipline within mathematics, a strongly regular graph is defined as follows. Let G = (V,E) be a regular graph with v vertices and degree k. G is said to be strongly regular if there are also integers λ and μ such that:
- Every two adjacent vertices have λ common neighbours.
- Every two non-adjacent vertices have μ common neighbours.
A graph of this kind is sometimes said to be an srg(v,k,λ,μ).
Some authors exclude graphs which satisfy the definition trivially, namely those graphs which are the disjoint union of one or more equal-sized complete graphs, and their complements, the Turán graphs.
A strongly regular graph is a distance-regular graph with diameter 2, but only if μ is non-zero.
Read more about Strongly Regular Graph: Properties, Examples, See Also
Famous quotes containing the words strongly, regular and/or graph:
“Los Angeles gives one the feeling of the future more strongly than any city I know of. A bad future, too, like something out of Fritz Lang’s feeble imagination.”
—Henry Miller (1891–1980)
“The solid and well-defined fir-tops, like sharp and regular spearheads, black against the sky, gave a peculiar, dark, and sombre look to the forest.”
—Henry David Thoreau (1817–1862)
“In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.”
—W.N.P. Barbellion (1889–1919)