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:
“No Government can be long secure without a formidable Opposition. It reduces their supporters to that tractable number which can be managed by the joint influences of fruition and hope. It offers vengeance to the discontented, and distinction to the ambitious; and employs the energies of aspiring spirits, who otherwise may prove traitors in a division or assassins in a debate.”
—Benjamin Disraeli (1804–1881)
“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)
“Won’t this whole instinct matter bear revision?
Won’t almost any theory bear revision?
To err is human, not to, animal.”
—Robert Frost (1874–1963)