Austin Warby added Two_graphs_are_said_to__.tex  about 8 years ago

Commit id: b42ab008f386a6e5771d4b8a2792d14d095f4d44

deletions | additions      

         

Two graphs are said to be isomorphic if there is a one to one matching between vertices of each graph and whenever one graph has an edge joining two vertices the other graph has an edge joining the matching pairs. An example of this can be seen below.