Greek Letters
$\beta$	Tunable parameter called confidence strength used in [60]
$\mathsf{\Gamma }\left(i\right)$	Neighbors of node i
${\eta }_i$	Betweenness centrality of node i
$\lambda$	Largest eigenvalue of $\mathcal{A}=a_{ij}$
$\sigma (i,j)$	Total number of geodesic paths between nodes i and j
$\sigma (i,j|v)$	Number of geodesic paths between nodes i and j that pass through v
Roman Letters
$\mathcal{A}=\left[a_{ij}\right]$	Adjacency matrix of elements $a_{ij}$ used to describe graph G
$C_i$	Closeness centrality of node i
$d(i,j)$	Distance between nodes i and j
E	Set of edges in graph G
f	Abstract information function of G
G	Graph
$G_i$	Subgraph where node i is the central node
H	Information or Shannon’s entropy
$IKS\left(i\right)$	Improved k-shells of node i
$k_i$	Degree of node i
$k_i^{\mathrm{in}}$	In-degree of node i
$k_i^{\mathrm{out}}$	Out-degree of node i
$k_{\max }$	Maximum degree in graph G
$k_{\min }$	Minimum degree in graph G
$k_i^q$	q degree power of node i
$k_i^1$	Sum of the degree of the neighbors of i, i.e., $k_i^1={\sum }_{j\in \mathsf{\Gamma }\left(i\right)}{k}_j$
$k_i^2$	Sum of the degree of the neighbors of i’s neighbors, i.e., $k_i^2={\sum }_{j\in \mathsf{\Gamma }\left(i\right)}{k}_j^1$
$k_j^{G_i}$	Degree of node j in the subgraph that has node i as central node
N	Number of nodes in G, $N=\left|V\right|$
$p_i$	Probability of an outcome
$s_i$	Strength of node i
$s_i^{\mathrm{in}}$	In-strength of node i
$s_i^{\mathrm{out}}$	Out-strength of node i
V	Set of edges in graph G, $V\ne \varnothing$, $V=\{v_0,v_1,...,v_N\}$
$\mathcal{W}=\left[w_{ij}\right]$	Weight matrix of elements $w_{ij}$ used to describe G
$x_i$	Eigenvector centrality of node i