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クライアントから使う