Hi
If there are two graphs, how would I go about proving that they are isomorphic. Also, how would I go about proving that two other graphs are not isomorphic. Thanks!
Printable View
Hi
If there are two graphs, how would I go about proving that they are isomorphic. Also, how would I go about proving that two other graphs are not isomorphic. Thanks!
Find one property one graph has and the other does not.Quote:
Originally Posted by undefined911
Like one graph has all vertex of degrees <=2 but the other has one vertex of degree 3, for example.
There are several free ‘graph theory programs’ available on the web.
Several of these the capacity to compare two graphs for an isomorphic relation. Basically they are programmed to compare the two adjacency matrices to see if one matrix can be transform by elementary operations into the other matrix. (That programming if beyond me of course.)
There is a simple way to see that two graphs are not isomorphic: If they have different degree sequences. Now they can have the same degree sequence and still not be isomorphic. That is, it is necessary that two graphs have the same degree sequence in order to be isomorphic, but it is not sufficient