gives the link efficiency of the graph g.


uses rules vw to specify the graph g.



open allclose all

Basic Examples  (2)

Find the link efficiency in the graph:

Graph link efficiency distribution of the WattsStrogatz graph model:

Scope  (4)

GraphLinkEfficiency works with undirected graphs:

Directed graphs:

Use rules to specify the graph:

GraphLinkEfficiency works with large graphs:

Applications  (2)

Find how tightly connected the overground line of the London Underground is with respect to the number of lines between stations:

Analyze the distribution of link efficiency in the WattsStrogatz graph model:

Distribution of link efficiency:

Expected value:

Properties & Relations  (5)

GraphLinkEfficiency is related to MeanGraphDistance:

The GraphLinkEfficiency is always less than 1:

The GraphLinkEfficiency of a complete graph is close to 1:

Test if a graph is complete using CompleteGraphQ:

The GraphLinkEfficiency of a path graph of length 1 is 0:

The GraphLinkEfficiency of a disconnected graph is -:

Use ConnectedGraphQ to test for connected graphs:

Possible Issues  (1)

Self-loops are ignored:

Wolfram Research (2012), GraphLinkEfficiency, Wolfram Language function, (updated 2015).


Wolfram Research (2012), GraphLinkEfficiency, Wolfram Language function, (updated 2015).


Wolfram Language. 2012. "GraphLinkEfficiency." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015.


Wolfram Language. (2012). GraphLinkEfficiency. Wolfram Language & System Documentation Center. Retrieved from


@misc{reference.wolfram_2023_graphlinkefficiency, author="Wolfram Research", title="{GraphLinkEfficiency}", year="2015", howpublished="\url{}", note=[Accessed: 17-April-2024 ]}


@online{reference.wolfram_2023_graphlinkefficiency, organization={Wolfram Research}, title={GraphLinkEfficiency}, year={2015}, url={}, note=[Accessed: 17-April-2024 ]}