Assertion: graph | /r/HasProperty | disconnected
Facets:
Source sentences:
text: A graph is connected if any two vertices of the graph are connected by a path; while a graph is disconnected if at least two vertices of the graph are not connected by a path.
text: If a graph G is disconnected, then every maximal connected subgraph of $G$ is called a connected component of the graph $G$.
text: If the graph is disconnected (and ), then this minimum is zero.