In this article we review some of the most relevant properties related to graph isomorphism and graph components. We start by introducing some concepts related to graph traversal (walks, paths, cycles, circuits), then we introduce two natural concepts related to connectivity: connected and strongly connected components. We consider then the definition of graph isomorphism and clique, and problems related to subgraph isomorphism and motif detection, like maximal clique, maximum clique and clique relaxations. We review two approaches that have widely applied to study graphs: network topology measures (average path length, diameter, cluster coefficient, degree distribution), centralization measures (degree centrality, closeness centrality, betweenness centrality, eigenvector centrality).

Dondi, R., Mauri, G., Zoppis, I. (2019). Graph Isomorphism. In S. Ranganathan, M. Gribskov, K. Nakai, C. Schönbach (a cura di), Encyclopedia of Bioinformatics and Computational Biology : ABC of Bioinformatics. Vol.1: Methods (pp. 933-939). Cambridge : Elsevier [10.1016/B978-0-12-809633-8.20423-8].

Graph Isomorphism

Dondi, R;Mauri, G;Zoppis, I
2019

Abstract

In this article we review some of the most relevant properties related to graph isomorphism and graph components. We start by introducing some concepts related to graph traversal (walks, paths, cycles, circuits), then we introduce two natural concepts related to connectivity: connected and strongly connected components. We consider then the definition of graph isomorphism and clique, and problems related to subgraph isomorphism and motif detection, like maximal clique, maximum clique and clique relaxations. We review two approaches that have widely applied to study graphs: network topology measures (average path length, diameter, cluster coefficient, degree distribution), centralization measures (degree centrality, closeness centrality, betweenness centrality, eigenvector centrality).
Capitolo o saggio
Centralization measures; Clique; Clustering coefficient; Connected component; Diameter; Graph isomorphism; Network motifs; Path and walk in a graph; Strongly connected component; Subgraph isomorphism
English
Encyclopedia of Bioinformatics and Computational Biology : ABC of Bioinformatics. Vol.1: Methods
Ranganathan, S; Gribskov, M; Nakai, K; Schönbach, C (Editors in Chief)
2019
9780128114148
1
Elsevier
933
939
Dondi, R., Mauri, G., Zoppis, I. (2019). Graph Isomorphism. In S. Ranganathan, M. Gribskov, K. Nakai, C. Schönbach (a cura di), Encyclopedia of Bioinformatics and Computational Biology : ABC of Bioinformatics. Vol.1: Methods (pp. 933-939). Cambridge : Elsevier [10.1016/B978-0-12-809633-8.20423-8].
none
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/197341
Citazioni
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
Social impact