Question

two isimorphic graph determine the same partition ​

Answer 1

Answer:

Graph isomorphism

In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H.

such that any two vertices u and v of G are adjacent in G if and only if f(u) and f(v) are adjacent in H. ...

If an isomorphism exists between two graphs, then the graphs are called isomorphic and denoted as.