graph eccentricity

the greatest distance between a specific vertex and any other vertex
Class type of: graph distance Q65556262

Facts

7 properties
Defining formula
e_G(v) = \max_{u \in V}d_G(v,u).
Greater than
graph radius[5]
In defining formula
e_G, V, d_G
Partial function domain
vertex set[3]
Studied by
graph theory[4]
🏷️ Also known as
en eccentricity en graph eccentricity en vertex eccentricity de Exzentrizität einer Ecke de Exzentrizität eines Knoten el εκκεντρότητα ru эксцентриситет вершины графа zh 偏心率 zh 圖離心率 zh 離心率
🔖 Identifiers · 1
MathWorld ID
GraphEccentricity

Report an error or request removal Lineage (PROV-JSON)

Press Enter · cited answer in seconds

Summary

graph eccentricity is a graph property[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). graph eccentricity. Retrieved November 16, 2026, from https://4ort.xyz/entity/graph-eccentricity
MLA “graph eccentricity.” 4ort.xyz Knowledge Graph, 4ort.xyz, 16 Nov. 2026, https://4ort.xyz/entity/graph-eccentricity.
BibTeX @misc{4ortxyz_graph-eccentricity_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{graph eccentricity}}, year = {2026}, url = {https://4ort.xyz/entity/graph-eccentricity}, note = {Accessed: 2026-11-16}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): graph eccentricity — https://4ort.xyz/entity/graph-eccentricity (retrieved 2026-11-16)

Canonical URL: https://4ort.xyz/entity/graph-eccentricity · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 5w ago · KrBot bot · 2026-10-08 view diff on Wikidata ↗
    "Changed qualifier: Criterion used: less than or equal to, разрешение перенаправления / resolving redirect less than or equal to → less than or equal to ()"
  2. 15w ago · KrBot bot · 2026-07-30 view diff on Wikidata ↗
    Wikidata description → the greatest distance between a specific vertex and any othe
    MathWorld ID → GraphEccentricity
    Studied by → graph theory
    Maintained by WikiProject → WikiProject Mathematics
    + 7 other properties edited (see Wikidata diff for full list)
    "Changed claim: Less than: graph diameter, разрешение перенаправления / resolving redirect graph diameter → graph diameter ()"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.