 Connected component (graph theory)

In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example, the graph shown in the illustration on the right has three connected components. A graph that is itself connected has exactly one connected component, consisting of the whole graph.
Contents
An equivalence relation
An alternative way to define connected components involves the equivalence classes of an equivalence relation that is defined on the vertices of the graph. In an undirected graph, a vertex v is reachable from a vertex u if there is a path from u to v. In this definition, a single vertex is counted as a path of length zero, and the same vertex may occur more than once within a path. Reachability is an equivalence relation, since:
 It is reflexive: There is a trivial path of length zero from any vertex to itself.
 It is symmetric: If there is a path from u to v, the same edges form a path from v to u.
 It is transitive: If there is a path from u to v and a path from v to w, the two paths may be concatenated together to form a path from u to w.
The connected components are then the induced subgraphs formed by the equivalence classes of this relation.
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.
Algorithms
It is straightforward to compute the connected components of a graph in linear time using either breadthfirst search or depthfirst search. In either case, a search that begins at some particular vertex v will find the entire connected component containing v (and no more) before returning. To find all the connected components of a graph, loop through its vertices, starting a new breadth first or depth first search whenever the loop reaches a vertex that has not already been included in a previously found connected component. Hopcroft and Tarjan (1973)^{[1]} describe essentially this algorithm, and state that at that point it was "well known".
There are also efficient algorithms to dynamically track the connected components of a graph as vertices and edges are added, as a straightforward application of disjointset data structures. These algorithms require amortized O(α(n)) time per operation, where adding vertices and edges and determining the connected component in which a vertex falls are both operations, and α(n) is a very slowgrowing inverse of the very quicklygrowing Ackermann function. A related problem is tracking connected components as all edges are deleted from a graph, one by one; an algorithm exists to solve this with constant time per query, and O(VE) time to maintain the data structure; this is an amortized cost of O(V) per edge deletion. For forests, the cost can be reduced to O(q + V log V), or O(log V) amortized cost per edge deletion.^{[2]}
Researchers have also studied algorithms for finding connected components in more limited models of computation, such as programs in which the working memory is limited to a logarithmic number of bits (defined by the complexity class L). Lewis & Papadimitriou (1982) asked whether it is possible to test in logspace whether two vertices belong to the same connected component of an undirected graph, and defined a complexity class SL of problems logspaceequivalent to connectivity. Finally Reingold (2008) succeeded in finding an algorithm for solving this connectivity problem in logarithmic space, showing that L = SL.
See also
 Strongly connected component, a related concept for directed graphs
 Biconnected component
 Modular decomposition, for a proper generalization of connected components on undirected graphs
 Connectedcomponent labeling, a basic technique in computer image analysis based on connected components of graphs
 Percolation theory, a theory describing the behavior of connected components in random subgraphs of grid graphs
 Centrality
References
 ^ Hopcroft, J.; Tarjan, R. (1973). "Efficient algorithms for graph manipulation". Communications of the ACM 16 (6): 372–378. doi:10.1145/362248.362272.
 ^ Shiloach, Y. and Even, S. 1981. An OnLine EdgeDeletion Problem. Journal of the ACM: 28, 1 (Jan. 1981), pp.14.
 Lewis, Harry R.; Papadimitriou, Christos H. (1982), "Symmetric spacebounded computation", Theoretical Computer Science 19 (2): 161–187, doi:10.1016/03043975(82)900585.
 Reingold, Omer (2008), "Undirected connectivity in logspace", Journal of the ACM 55 (4): Article 17, 24 pages, doi:10.1145/1391289.1391291.
External links
 Connected components, Steven Skiena, The Stony Brook Algorithm Repository
Categories: Graph connectivity
Wikimedia Foundation. 2010.
Look at other dictionaries:
Connectedcomponent labeling — (alternatively connected component analysis, blob extraction, region labeling, blob discovery, or region extraction) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given… … Wikipedia
Connected Component Labeling — (alternatively connected component analysis) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected component labeling is not to be confused with… … Wikipedia
Connected component — Connected components are part of topology and graph theory, two related branches of mathematics. For the graph theoretic concept, see connected component (graph theory). In topology: connected component (topology). Implementations: Connected… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Star (graph theory) — Star The star S7. (Some authors index this as S8.) Vertices k+1 Edges k … Wikipedia
Dominator (graph theory) — For Dominating set problem, see Dominating set. In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By… … Wikipedia
Bridge (graph theory) — A graph with 6 bridges (highlighted in red) An undirected connected graph with no cut … Wikipedia