Table 1.

Notation . | Description . |
---|---|

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 |

d_{Hamming}(G′, G″) | Hamming distance between G′ and G″ |

d_{GED}(G′, G″) | Graph edit distance between G′ and G″ |

A | Adjacency matrix |

Λ | Laplacian matrix |

D | Degree matrix |

k_{i} | Degree of node i |

Notation . | Description . |
---|---|

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 |

d_{Hamming}(G′, G″) | Hamming distance between G′ and G″ |

d_{GED}(G′, G″) | Graph edit distance between G′ and G″ |

A | Adjacency matrix |

Λ | Laplacian matrix |

D | Degree matrix |

k_{i} | Degree of node i |

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