GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/Radius

GraphTheory

  

Radius

  

find the minimum eccentricity of a graph

 

Calling Sequence

Parameters

Description

Examples

Compatibility

Calling Sequence

Radius(G)

Parameters

G

-

graph

Description

• 

Radius returns the minimum eccentricity over all vertices in the graph G.

• 

If G is disconnected, then the output is infinity.

• 

For weighted graphs the edge weights are used to denote the distance accrued while traveling along each edge.  For unweighted graphs the length of each edge is assumed to be 1.

Examples

withGraphTheory:

withSpecialGraphs:

PPetersenGraph

PGraph 1: an undirected unweighted graph with 10 vertices and 15 edge(s)

(1)

RadiusP

2

(2)

CCycleGraph19

CGraph 2: an undirected unweighted graph with 19 vertices and 19 edge(s)

(3)

RadiusC

9

(4)

GGraph1,2,0.2,1,4,1.1,2,3,0.3,3,4,0.4

GGraph 3: an undirected weighted graph with 4 vertices and 4 edge(s)

(5)

DrawGraphG

RadiusG

0.5

(6)

The distance between vertices 1 and 4 is maximal

DijkstrasAlgorithmG,1,4

1,2,3,4,0.9

(7)

Compatibility

• 

The GraphTheory[Radius] command was introduced in Maple 2017.

• 

For more information on Maple 2017 changes, see Updates in Maple 2017.

See Also

AllPairsDistance

Diameter

DijkstrasAlgorithm

Distance

Eccentricity