Example: The First Betti Number in Graph Theory
In topological graph theory the first Betti number of a graph G with n vertices, m edges and k connected components equals
This may be proved straightforwardly by mathematical induction on the number of edges. A new edge either increments the number of 1-cycles or decrements the number of connected components.
See cyclomatic complexity for an application of the first Betti number in software engineering.
Read more about this topic: Betti Number
Famous quotes containing the words number, graph and/or theory:
“If matrimony be really beneficial to society, the custom that ... married women alone are allowed any claim to place, is as useful a piece of policy as ever was invented.... The ridicule fixed on the appellation of old maid hath, I doubt not, frightened a very large number into the bonds of wedlock.”
—Sarah Fielding (1710–1768)
“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)
“... liberal intellectuals ... tend to have a classical theory of politics, in which the state has a monopoly of power; hoping that those in positions of authority may prove to be enlightened men, wielding power justly, they are natural, if cautious, allies of the “establishment.””
—Susan Sontag (b. 1933)