Abstract
We review some of the most relevant properties related to graph isomorphism and graph components. First, we introduce some concepts related to graph traversal (walks, paths, cycles, circuits) and we introduce two natural concepts related to connectivity: connected and strongly connected components. Then we introduce graph isomorphism and subisomorphism, cohesive graphs and motif detection. We also consider measures that have widely applied to study graphs: network topology measures and centralization measures.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
