gives the set of vertices with maximum vertex degree in the underlying simple graph of g.
gives the set of vertices with maximum vertex in-degree.
gives the set of vertices with maximum vertex out-degree.
uses rules vw to specify the graph g.
- The vertex degree for a vertex v is the number of edges incident to v.
- For a directed graph, the in-degree is the number of incoming edges and the out-degree is the number of outgoing edges.
- For an undirected graph, an edge is taken to be both an in-edge and out-edge.
Basic Examples (1)
Find the hub for a graph:
Properties & Relations (11)
Introduced in 2012
Updated in 2015