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