DegreeCentrality

DegreeCentrality[g]
给出 g 的内在简单图中顶点的顶点度列表.

DegreeCentrality[g,"In"]
给出顶点入度列表.

DegreeCentrality[g,"Out"]
给出顶点出度列表.

更多信息更多信息

  • DegreeCentrality 对具有较高顶点度的顶点给出高中心度.
  • 顶点 的顶点度是与 相关联的边数.
  • 对于一个有向图,入度是入边的数目,而出度是出边的数目.
  • 对于一个无向图,入度和出度一致.

背景
背景

  • DegreeCentrality returns a list of nonnegative integers ("degree centralities") that are particular centrality measures of the vertices of a graph. Degree centrality is a measure of the centrality of a node in a network and is defined as the number of edges (including self-loops) that lead into or out of the node. Degree centralities therefore lie between and inclusive, where is the number of vertices in a graph, and identify nodes in the network by their influence on other nodes in their immediate neighborhood. This measure has found applications in social networks, transportation, biology, and the social sciences.
  • A second argument "In" or "Out" can be used to give a list of vertex in- or out-degrees, respectively, which correspond to one another for undirected graphs.
  • DegreeCentrality is a local measure that is equivalent to VertexDegree for simple graphs. Similar centrality measures include EigenvectorCentrality and KatzCentrality.

范例范例打开所有单元关闭所有单元

基本范例  (2)基本范例  (2)

计算度中心度:

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

突出显示:

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

对顶点排序. 排在最前面的顶点与其他顶点具有最多的连接数:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=
2010年引入
(8.0)