Vertex Eccentricity Calculator

ecc(v) = max d(v,u)

CalculatorsFreeNo Signup
4.9(446 reviews)
All Tools

Loading tool...

About Vertex Eccentricity Calculator

A vertex eccentricity calculator finding ecc(v) = max{d(v,u)} for each vertex v. Max eccentricity = diameter, min eccentricity = radius. Peripheral vertices have ecc=diam. Central vertices have ecc=rad. Client-side.

Vertex Eccentricity Calculator Features

  • All ecc(v)
  • Peripheral/central
  • Eccentricity sequence
  • Diameter/radius
  • Distance matrix
Vertex eccentricity ecc(v) = max d(v,u): farthest distance from v. The eccentricity sequence lists all ecc values. max ecc = diameter, min ecc = radius. Peripheral: ecc=diam. Central: ecc=rad.

How to Use

Select graph:

  • ecc(v): Per vertex
  • Classes: Central/peripheral
  • Sequence: All values

Vertex Classification

Central vertex: ecc(v)=rad(G). Peripheral vertex: ecc(v)=diam(G). In a path P_n: endpoints are peripheral (ecc=n-1), middle is central (ecc=⌈(n-1)/2⌉).

Properties

For any edge uv: |ecc(u)-ecc(v)|≤1. Eccentricity is a 1-Lipschitz function on the vertex set. The eccentricity sequence determines diam, rad, center, and periphery.

Step-by-Step Instructions

  1. 1Select graph.
  2. 2Compute all ecc(v).
  3. 3Find central vertices.
  4. 4Find peripheral vertices.
  5. 5Get diam and rad.

Vertex Eccentricity Calculator — Frequently Asked Questions

How are eccentricities computed?+

BFS from each vertex gives distances to all others. ecc(v) = max distance from v. Total: O(n(n+m)). For weighted: Dijkstra from each vertex. No known faster algorithm for general graphs.

What's the eccentricity sequence?+

The multiset of eccentricities, sorted. For P_5: eccentricities are (4,3,2,3,4), sorted sequence is (2,3,3,4,4). This gives more info than just diam and rad.

What's self-centered?+

A graph where all vertices have the same eccentricity (rad=diam). Examples: K_n, C_n (n odd). Every distance-regular graph is self-centered. Self-centered graphs are 'uniformly spread out'.

Share this tool: