finds minimum vertex degree in a graph
graph or network
vertex of minimum degree (returned)
Important:The networks package has been deprecated. Use the superseding command GraphTheory[MinimumDegree]instead.
The total number of edges (undirected, including loops) incident at each vertex is computed, and the minimum of these values is returned.
If a name vname is specified it is assigned the name of a vertex of minimum degree.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[mindegree](...).
G ≔ complete⁡4:
Download Help Document
What kind of issue would you like to report? (Optional)