search

w3c / N3

W3C's Notation 3 (N3) Community Group
48 stars 18 forks source link

graph isomorphism #199

Open pfps opened 1 year ago

pfps commented 1 year ago

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.

doerthe commented 1 year ago

You are right. We plan to add these and a few other proofs for the next release.

In the mean time we encourage you to ask for all the details (proofs) you would be interested in.

Thank you for your comments.