TABLE 4.

Graph features.

Feature	Description	Feature	Description
Number_of_nodes	The number of nodes in the graph .	Eigen_one_L	Number of eigenvalues of Laplacian matrix that have a value of one .
Number_of_edges	The number of edges in the graphs (interaction between the nodes).	Eigen_two_L	Number of eigenvalues of Laplacian matrix that have a value of two .
Eccentricity	The maximum graph distance between a vertex v and any other vertex u in a connected graph G .	Lower_slope_L	Line segment’s slope that corresponds to Laplacian matrix’s eigenvalues between 0 and 1.
Diameter	Maximum eccentricity.	Upper_Slope_L	Line segment’s slope that corresponds to Laplacian matrix’s eigenvalues between 1 and 2.
Radius	Minimum eccentricity.	Lower_slope_A	Line segment’s slope that corresponds to adjacency matrix’s eigenvalues between 0 and 1.
Center	The group of nodes having an eccentricity equal to the radius.	Upper_slope_A	Line segment’s slope that corresponds to adjacency matrix’s eigenvalues between 1 and 2
Closeness_of_node	Denotes node’s proximity to all other nodes in the network.	Eigen_zero_A	Number of eigenvalues of adjacency matrix that have a value of zero.
Average_clustering	Mean of local clustering of the graph.	Eigen_one_A	Number of eigenvalues of adjacency matrix that have a value of one.
Node_clustering	Degree to which nodes in a graph tend to cluster together.	Eigen_two_A	Number of eigenvalues of adjacency matrix that have a value of two.
Trace_A	Sum of the diagonal elements of the adjacency matrix from upper left to lower right.	Sorenson	Ratio of nodes u and v’s common neighbors to their average node degrees.
Energy_A	Sum of absolute value of adjacency matrix’s eigenvalues .	Salton	Angle between columns of the adjacency matrix corresponding to the specified vertices, expressed as a cosine.
Connected_ratio	Number of nodes in the graph’s largest connected component divided by the overall number of nodes.	Hub_promoted	Ratio of common neighbors of nodes a and b to the minimum of their node degrees .
Trace_L	Sum of its diagonal entries and the sum of its eigenvalues of Laplacian matrix.	Hub_Depressed	Ratio of common neighbors of nodes a and b to the maximum of their node degrees .
Energy_L	Absolute value sum of Laplacian matrix’s eigenvalues .	Global_overlap	The number of all possible paths between two particular nodes.
Node_degree_0	Number of nodes with degree zero .	Mean_all_neighbors	The mean of the distance between a vertex v and all its neighbors in the graph G.
Node_degree_one	Number of nodes with degree one .	Skew_all_neighbors	Skewness of edge lengths between a node v and all its neighbors.
Eigen_zero_L	Number of eigenvalues of Laplacian matrix that have a value of zero.	Kurtosis_all_neighbors	Kurtosis of edge lengths between a node v and all its neighbors.