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:
“I am glad of this war. It kicks the pasteboard bottom in of the usual “good” popular novel. People have felt much more deeply and strongly these last few months.”
—D.H. (David Herbert)
“It was inspiriting to hear the regular dip of the paddles, as if they were our fins or flippers, and to realize that we were at length fairly embarked. We who had felt strangely as stage-passengers and tavern-lodgers were suddenly naturalized there and presented with the freedom of the lakes and woods.”
—Henry David Thoreau (1817–1862)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)