更改

The definition of centrality on the node level can be extended to the whole graph, in which case we are speaking of graph centralization. Let <math>v*</math> be the node with highest degree centrality in <math>G</math>. Let <math>X:=(Y,Z)</math> be the <math>|Y|</math>-node connected graph that maximizes the following quantity (with <math>y*</math> being the node with highest degree centrality in <math>X</math>):

The definition of centrality on the node level can be extended to the whole graph, in which case we are speaking of graph centralization. Let <math>v*</math> be the node with highest degree centrality in <math>G</math>. Let <math>X:=(Y,Z)</math> be the <math>|Y|</math>-node connected graph that maximizes the following quantity (with <math>y*</math> being the node with highest degree centrality in <math>X</math>):

节点级中心性的定义可以扩展到整个图，在这种情况下，我们指的是图的中心性。<ref>Freeman, Linton C. "Centrality in social networks conceptual clarification." Social networks 1.3 (1979): 215–239.</ref>设 < math > v </math > 为 < math > g </math > 中度中心性最高的节点。让 < math > x: = (y，z) </math > 是 < math > | y | </math > 节点连接图，最大化下列数量(< math > y * </math > 是 < math > 中度最高的节点) :

节点级中心性的定义可以扩展到整个图，在这种情况下，我们指的是图的中心度。<ref>Freeman, Linton C. "Centrality in social networks conceptual clarification." Social networks 1.3 (1979): 215–239.</ref>设 < math > v </math > 为 < math > g </math > 中度中心性最高的节点。让 < math > x: = (y，z) </math > 是 < math > | y | </math > 节点连接图，最大化下列数量(< math > y * </math > 是 < math > 中度最高的节点) :

Correspondingly, the degree centralization of the graph <math>G</math> is as follows:

Correspondingly, the degree centralization of the graph <math>G</math> is as follows:

相应地，图形 < math > g </math > 的度中心性如下:

相应地，图形 < math > g </math > 的度中心度如下: