GraphLinkEfficiency

Available

Link efficiency 1 minus mean graph distance over edge count

Forms

GraphLinkEfficiency[g]

GraphLinkEfficiency[{v -> w, …}]

Verified examplesg = KnightTourGraph[7, 4]; GraphLinkEfficiency[g] → 4867/5103

Run this on Qurak Search the reference

Topics

Graph Properties And Measurements - Connectivity Measures
New In90 Alphabetical Listing - G
Summary Of New Features In141 - Graphs & Networks
Summary Of New Features In141 - Graphs & Networks

Related

GraphDistance MeanGraphDistance GraphDensity GlobalClusteringCoefficient GraphAssortativity BetweennessCentrality BipartiteGraphQ ButterflyGraph ChromaticPolynomial EulerianGraphQ GraphDistanceMatrix LocalClusteringCoefficient

All 6300 functions · Use this from an MCP client