How do i prove whether the graph isomorphism problem falls under np problem?

Question

Can we consider that all graph isomorphism problems falls under NP problem? If so, how do i proved it? Any help is appreciated.