Category:Definitions/Disconnected Graphs
Jump to navigation
Jump to search
This category contains definitions related to Disconnected Graphs.
Related results can be found in Category:Disconnected Graphs.
Let $G = \struct {V, E}$ be a graph.
Then $G$ is disconnected if and only if it is not connected.
That is, if and only if there exists (at least) two vertices $u, v \in V$ such that $u$ and $v$ are not connected.
Pages in category "Definitions/Disconnected Graphs"
The following 2 pages are in this category, out of 2 total.