compute graph eccentricity
(optional) vertex of G
(optional) one or more options as specified below
The options argument can contain one or more of the options shown below.
output=Array, DataSeries, list, or Vector.
This option specifies an alternate container type for the return value. When output is one of Array, list, or Vector, a container of the named type containing the eccentricities for each vertex is returned. When output is DataSeries, the return value is a DataSeries object whose labels correspond to the graph vertices and whose values are the computed eccentricities for the associated vertices. The default container type is a list.
The output option cannot be used when a particular vertex v is specified.
The Eccentricity(G,v) command computes the eccentricity for the vertex v in the graph G.
The Eccentricity(G) command returns a list of the computed eccentricities for each vertex in the graph G, listed in the order in which the vertices appear in the list returned by Vertices(G).
The eccentricity of a vertex v in a graph G is a number which represents the maximum graph distance between v and any other vertex in the graph.
If G is disconnected, then the eccentricity for every vertex is infinity.
If G is a complete graph, then the eccentricity for every vertex is 1.
The maximum of the eccentricities in G is the diameter of G. The minimum of the eccentricities in G is the radius of G.
G ≔ Graph⁡1,2,3,4,5,6,1,3,1,6,2,6,2,4,3,6,4,6,4,5,5,6
G≔Graph 1: an undirected unweighted graph with 6 vertices and 8 edge(s)
Compute the eccentricity for vertex 6.
Produce a list of eccentricities for all vertices.
Produce a DataSeries with labels corresponding to the named vertices.
H ≔ Graph⁡a,b,c,d,a,b,b,c,c,d,a,d
H≔Graph 2: an undirected unweighted graph with 4 vertices and 4 edge(s)
The GraphTheory[Eccentricity] command was introduced in Maple 2017.
For more information on Maple 2017 changes, see Updates in Maple 2017.
Download Help Document
What kind of issue would you like to report? (Optional)