VertexEccentricity

VertexEccentricity(graph, vertex)

compute the eccentricity of vertex in the graph. It’s the length of the longest shortest path from the vertex to every other vertex in the graph.

See

• Wikipedia - Distance (graph_theory)

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EdgeQ, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindVertexCover, FindShortestPath, FindShortestTour, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of VertexEccentricity