Degree
|
deg
(v) := deg(v)
|
For directed graphs in- and out-degree is used.
| |
Eccentricity
|
| |
[28]
|
Closeness
|
| |
[29]
|
Radiality
|
|
Δ
G
is the diameter of the graph G, defined as the maximum distance between any two vertices of G.
|
[30]
|
Centroid Value
|
cen
(v) := min{f(v, w) : w ∈ V\{v}}
|
Where f(v, w) := γ
v
(w) - γ
w
(v) and γ
v
(w) denotes the number of vertices that are closer to v than to w.
|
[31]
|
Stress
|
str
(v) :=∑s≠v∈V∑t≠v∈Vδ
st
(v)
| |
[32]
|
S.-P. Betweenness
|
spb
(v) :=∑s≠v∈V∑t≠v∈Vδ
st
(v)
|
|
[33]
|
C.-F. Closeness
|
|
Where p
vt
(t) equals the potential difference in an electrical network.
|
[21]
|
C.-F. Betweenness
|
|
Where τ
st
(v) equals the fraction of electrical current running over vertex v in an electrical network.
|
[21]
|
Katz Status
|
|
Where α is a positive constant.
|
[34]
|
Eigenvector
|
λ
eiv
= A
eiv
|
The eigenvector to the dominant eigenvalue of A is used.
|
[35]
|
Hubbell index
|
hbl
= + W
hbl
|
Where is some exogenous input and W is a weight matrix derived from the adjacency matrix A.
|
[36]
|
Bargaining
|
brg
:= α(I - βA)-1A
|
Where α is scaling factor and β is the influence parameter.
|
[37]
|
PageRank
|
pr
= dP
pr
+ (1 - d)
|
Where P is the transition matrix and d is the damping factor.
|
[38]
|
HITS-Hubs
|
hubs
= A
auths
|
Assuming
auths
is known.
|
[39]
|
HITS-Authorities
|
auths
= AT
hubs
|
Assuming
hubs
is known.
|
[39]
|
Closeness- vitality
|
clv
(v) := WI(G) - WI(G\{v})
|
Where WI(G) is the Wiener index of the graph G.
|
[8]
|