gives the link efficiency of the graph g.
uses rules vw to specify the graph g.
Examplesopen allclose all
Basic Examples (2)
Properties & Relations (5)
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: