An Algorithm to Reduce the Number of Graphs to Be Handled in the Test for Isomorphism among Planetary Gear Trains

Synthesis of Planetary Gear Trains (PGTs) is done by many authors and Hamming number method is one of many available tests for isomorphism. Testing for structural isomorphism in PGTs is followed by drawing the rotational graphs for the remaining structurally non-isomorphic PGTs after assigning the levels to various turning pairs in the PGTs to verify if the PGTs are possible cases or violate fundamental rules of PGTs. For less number of links in a given degree of freedom PGTs the number of graphs to be handled is less. To reduce the number of graphs to be handled with higher number of links an algorithm is proposed. Labelling algorithm is also given.