GraphHub

GraphHub[g]
gives the set of vertices with maximum vertex degree in the underlying simple graph of g.

GraphHub[g,"In"]
gives the set of vertices with maximum vertex in-degree.

GraphHub[g,"Out"]
gives the set of vertices with maximum vertex out-degree.

DetailsDetails

  • 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.
Introduced in 2012
(9.0)