Question

"any two graphs are isomorphic, if they are one to one and onto" define this statement?​

Answer 1

Answer:

Step-by-step explanation:

Two graphs G and H are isomorphic if there is a one-to-one onto function (a bijection) f between the vertices of G and H such that there is an edge between vertices u and v in G if and only if there is an edge between the vertices f(u)and f(v) in H. ... That also means that non-edges go to non-edges.