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.
Examplesopen allclose all
Properties & Relations (11)
Or with respect to VertexInDegree:
Or with respect to VertexOutDegree:
For a CompleteGraph, every vertex is a hub:
For a PathGraph, all vertices except for the endpoints are hubs:
For a CycleGraph, every vertex is a hub:
For a WheelGraph of size 5 or more, the hub of the wheel is the graph hub:
For a GridGraph, all vertices that are not at an edge of the grid are hubs:
For a CompleteKaryTree, all vertices except for the leaves and the root are hubs:
The BetweennessCentrality center of a graph:
The ClosenessCentrality center:
The EigenvectorCentrality center:
Possible Issues (1)
Use VertexDegree to find the center with self-loops included:
Wolfram Research (2012), GraphHub, Wolfram Language function, https://reference.wolfram.com/language/ref/GraphHub.html (updated 2015).
Wolfram Language. 2012. "GraphHub." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/GraphHub.html.
Wolfram Language. (2012). GraphHub. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/GraphHub.html