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:
“Not too many years ago, a child’s experience was limited by how far he or she could ride a bicycle or by the physical boundaries that parents set. Today ... the real boundaries of a child’s life are set more by the number of available cable channels and videotapes, by the simulated reality of videogames, by the number of megabytes of memory in the home computer. Now kids can go anywhere, as long as they stay inside the electronic bubble.”
—Richard Louv (20th century)
“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)
“Frankly, these days, without a theory to go with it, I can’t see a painting.”
—Tom Wolfe (b. 1931)