VertexEccentricity

Tersedia

Maximum distance from a vertex.

Bentuk

VertexEccentricity[g, s]

VertexEccentricity[{v -> w, …}, …]

Contoh disahkang = PetersenGraph[9, 4]; HighlightGraph[g, Table[Labeled[v, VertexEccentricity[g, v]], {v, VertexList[g]}]] → Graph[<18>, <27>]Pilihan

EdgeWeight — default Automatic
Method — default Automatic

Jalankan ini di Qurak Cari dalam rujukan

Topik

Graph Measures - Distance Measures
Graph Paths Cycles And Flows - Longest Shortest Paths
Graph Properties And Measurements - Distance Measures
New In80 Alphabetical Listing - V
Summary Of New Features In141 - Graphs & Networks
Summary Of New Features In141 - Graphs & Networks

Berkaitan

GraphRadius GraphDiameter GraphCenter GraphPeriphery GraphDistanceMatrix MeanGraphDistance BetweennessCentrality BipartiteGraphQ ButterflyGraph ChromaticPolynomial EulerianGraphQ GlobalClusteringCoefficient

Semua 6300 fungsi · Gunakan ini daripada klien MCP