Abstract
The development of an efficient solution procedure for the enumeration of epicyclic gear trains based on the standard code technique for colored graphs is introduced. The results for such gear trains with up to eight links and having six gear pairs are presented. The efficiency of checking isomorphisms of various graphs by the standard code algorithm makes this solution procedure to be very efficient compared to the existing methods. Using this study, correct numbers are identified for structurally different gear trains over which there has been minor discrepancies between previous researchers. Further, this study has enabled the discovery of cospectral colored graphs for the very first time.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
