The Number of Connected Components
The number of connected components is an important topological invariant of a graph. In topological graph theory it can be interpreted as the zeroth Betti number of the graph. In algebraic graph theory it equals the multiplicity of 0 as an eigenvalue of the Laplacian matrix of the graph. It is also the index of the first nonzero coefficient of the chromatic polynomial of a graph. Numbers of connected components play a key role in the Tutte theorem characterizing graphs that have perfect matchings, and in the definition of graph toughness.
Read more about this topic: Connected Component (graph Theory)
Famous quotes containing the words number, connected and/or components:
“As Jerome expanded, its chances for the title, “the toughest little town in the West,” increased and when it was incorporated in 1899 the citizens were able to support the claim by pointing to the number of thick stone shutters on the fronts of all saloons, gambling halls, and other places of business for protection against gunfire.”
—Administration in the State of Ariz, U.S. public relief program (1935-1943)
“War and culture, those are the two poles of Europe, her heaven and hell, her glory and shame, and they cannot be separated from one another. When one comes to an end, the other will end also and one cannot end without the other. The fact that no war has broken out in Europe for fifty years is connected in some mysterious way with the fact that for fifty years no new Picasso has appeared either.”
—Milan Kundera (b. 1929)
“Hence, a generative grammar must be a system of rules that can iterate to generate an indefinitely large number of structures. This system of rules can be analyzed into the three major components of a generative grammar: the syntactic, phonological, and semantic components.”
—Noam Chomsky (b. 1928)