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.

GraphHub[{vw,},]

uses rules vw to specify the graph g.

Details

  • 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.

Examples

open allclose all

Basic Examples  (1)

Find the hub for a graph:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=

Highlight:

In[3]:=
Click for copyable input
Out[3]=

Scope  (5)

Applications  (7)

Properties & Relations  (11)

Possible Issues  (1)

See Also

VertexDegree  VertexInDegree  VertexOutDegree  DegreeCentrality

Introduced in 2012
(9.0)
| Updated in 2015
(10.3)