GraphLinkEfficiency

可用

Link efficiency 1 minus mean graph distance over edge count

形式

GraphLinkEfficiency[g]

GraphLinkEfficiency[{v -> w, …}]

验证过的示例g = KnightTourGraph[7, 4]; GraphLinkEfficiency[g] → 4867/5103

在 Qurak 上运行搜索参考

主题

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

相关

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

全部 6300 个函数 · 从 MCP 客户端使用