gives the minimum eccentricity of the vertices in the graph g.

uses rules vw to specify the graph g.

# Details and Options

• The following options can be given:
•  EdgeWeight Automatic weight for each edge Method Automatic method to use
• Possible Method settings include "Dijkstra", "FloydWarshall", and "Johnson".

# Examples

open allclose all

## Basic Examples(1)

Give the graph radius for a complete graph:

## Scope(7)

Directed graphs:

Weighted graphs:

Multigraphs:

Mixed graphs:

Use rules to specify the graph:

## Applications(1)

Illustrate the radius in two Petersen graphs:

For a CompleteGraph, the radius is 1:

For a PathGraph of size , the radius is :

For a CycleGraph of size , the radius is :

For a WheelGraph, the radius is 1:

For a GridGraph of size {m,n}, the radius is :

For a CompleteKaryTree tree of depth , the radius is :

## Properties & Relations(1)

For a connected graph, the radius can be computed by VertexEccentricity: