Vipul: Created page with "{{undirected graph property}} ==Definition== An undirected graph is termed '''connected''' if it satisfies the following equivalent conditions: # Given any two distinct..."

2012-05-27T19:07:49Z

Created page with "{{undirected graph property}} ==Definition== An undirected graph is termed '''connected''' if it satisfies the following equivalent conditions: # Given any two distinct..."

New page

{{undirected graph property}}

==Definition==

An [[undirected graph]] is termed '''connected''' if it satisfies the following equivalent conditions:

# Given any two distinct vertices of the graph, there is a path from one vertex to the other.
# It contains a [[subgraph]] on the entire vertex set that is a [[tree]].
# The [[geometric realization]] of the graph is [[topospaces:connected topological space|connected as a topological space]].

Typically, we do not use the term ''connected'' or ''disconnected'' for a graph with no vertices.

Connected graph - Revision history

Vipul: Created page with "{{undirected graph property}} ==Definition== An undirected graph is termed '''connected''' if it satisfies the following equivalent conditions: # Given any two distinct..."