Abstract
A method of selecting nonisomorphic graphs is introduced with the aid of graph enumeration theory. Edge permutations which are induced from the symmetric group of vertex permutations are used as mapping functions to identify nonisomorphic graphs. This method is applied to the enumeration of nonisomorphic graphs of epicyclic gear trains. The results with 7 elements are presented in detail.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
