Connected Graph Component

A Connected Graph Component is a connected graph in a component of relation with a disconnected graph.

• Context:
  • It can range from being a Strongly Connected Component (on a directed disconnected graph) to being a Weakly Connected Component (on a undirected disconnected graph).
• See: Subset.

---

---

References

2013

• http://en.wikipedia.org/wiki/Connected_component_%28graph_theory%29
  • 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 in the supergraph. 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.

---