|
networks[mindegree] - finds minimum vertex degree in a graph
|
|
Calling Sequence
|
|
mindegree(G)
mindegree(G, vname)
|
|
|
Parameters
|
|
|
G
|
-
|
graph or network
|
|
vname
|
-
|
vertex of minimum degree (returned)
|
|
|
|
|
|
Description
|
|
|
•
|
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](...).
|
|
|
|
See Also
|
|
GraphTheory, GraphTheory[MinimumDegree], networks(deprecated)[head], networks(deprecated)[indegree], networks(deprecated)[maxdegree], networks(deprecated)[neighbors], networks(deprecated)[outdegree], networks(deprecated)[tail], networks(deprecated)[vertices], networks(deprecated)[vweight], with
|
|
Download Help Document
Was this information helpful?
