Vipul: Created page with "{{undirected graph property}} ==Definition== Note that in the definition below, we exclude the case of the graph with zero vertices, which we trivially assume to have finite..."

2012-05-28T17:31:36Z

Created page with "{{undirected graph property}} ==Definition== Note that in the definition below, we exclude the case of the graph with zero vertices, which we trivially assume to have finite..."

New page

{{undirected graph property}}

==Definition==

Note that in the definition below, we exclude the case of the graph with zero vertices, which we trivially assume to have finite diameter.

A [[connected graph|connected]] [[undirected graph]] is termed a '''graph of finite diameter''' if it satisfies the following equivalent conditions:

# There is a vertex whose [[defining ingredient::eccentricity of a vertex|eccentricity]] is finite.
# The eccentricity of every vertex of the graph is finite.
# The [[radius of a graph|radius]] of the graph is finite.
# The [[diameter of a graph|diameter]] of the graph is finite.

Graph of finite diameter - Revision history

Vipul: Created page with "{{undirected graph property}} ==Definition== Note that in the definition below, we exclude the case of the graph with zero vertices, which we trivially assume to have finite..."