0
$\begingroup$

As far as I know, for two undirected graphs $G = (V, E) $ and $H = (V', E')$, the following criteria is necessary for them to be isomorphic:

  1. $|V| = |V'|$
  2. $|E| = |E'|$
  3. $G$ has $j$ nodes of degree $k$ $\Leftrightarrow $ $H$ has $j$ nodes of degree $k$

Are there more that are that obvious? Thanks in advance for your help!

$\endgroup$
1
$\begingroup$

For two graphs $G$ and $H$ it is necessary for literally every property that holds of $G$ to also hold of $H$ and vice-versa. There's no point making a list because everything is in that list.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.