Ulam's Conjecture is True for Connected Graphs
In this endeavor, we prove that Ulam's conjecture is true for connected graphs. Initially, we present a new algorithm for graph isomorphism. Then the statement of the conjecture is transformed to the newly developed algorithm.
Do you want to exchange books? It’s EASY!
Get registered and find other users who want to give their favourite books to good hands!
