GraphDensity

Available

Edge count relative to the complete graph (2m/n(n-1))

Forms

GraphDensity[g]

GraphDensity[{v -> w, …}]

Verified examplesGraphDensity /@ graphs → graphs GraphDensity[#, SelfLoops -> True]& /@ graphs → graphs

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

GraphLinkEfficiency VertexCount EdgeCount GlobalClusteringCoefficient GraphAssortativity BetweennessCentrality BipartiteGraphQ ButterflyGraph ChromaticPolynomial EulerianGraphQ GraphDistanceMatrix LocalClusteringCoefficient

All 6300 functions · Use this from an MCP client