Skip to Main Content
Table 1. 
Notation and description.
NotationDescription
N, n Set of nodes, number of nodes 
E, m Set of edges, number of edges 
G Graph 
λ Eigenvalue 
C Clustering coefficient 
L Shortest path length 
S Synchronizability 
BC Betweenness centrality 
d Density 
dHamming(G′, G″) Hamming distance between G′ and G″ 
dGED(G′, G″) Graph edit distance between G′ and G″ 
A Adjacency matrix 
Λ Laplacian matrix 
D Degree matrix 
ki Degree of node i 
NotationDescription
N, n Set of nodes, number of nodes 
E, m Set of edges, number of edges 
G Graph 
λ Eigenvalue 
C Clustering coefficient 
L Shortest path length 
S Synchronizability 
BC Betweenness centrality 
d Density 
dHamming(G′, G″) Hamming distance between G′ and G″ 
dGED(G′, G″) Graph edit distance between G′ and G″ 
A Adjacency matrix 
Λ Laplacian matrix 
D Degree matrix 
ki Degree of node i 
View Large
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy.
Accept