As far as I can tell, graph isomorphism is claimed to be symmetric without proof.
As far as I can tell, graph isomorphism is not claimed to be reflexive or transitive.
I suspect that there should be proofs that graph isomorphism is indeed symmetric, reflexive, and transitive.
As far as I can tell, graph isomorphism is claimed to be symmetric without proof.
As far as I can tell, graph isomorphism is not claimed to be reflexive or transitive.
I suspect that there should be proofs that graph isomorphism is indeed symmetric, reflexive, and transitive.