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:
“In this world, which is so plainly the antechamber of another, there are no happy men. The true division of humanity is between those who live in light and those who live in darkness. Our aim must be to diminish the number of the latter and increase the number of the former. That is why we demand education and knowledge.”
—Victor Hugo (1802–1885)
“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)
“Frankly, these days, without a theory to go with it, I can’t see a painting.”
—Tom Wolfe (b. 1931)