Abstract
As well known, graph theory is a powerful tool for mechanism design. The enumeration of planet gear trains can be converted the synthesis of graphs while a planetary gear train is converted to a graph. During the enumeration of graphs, the problem of isomorphism should be solved. This paper proposes a novel algorithm used to generate non-isomorphism graphs and thereby omits the part of isomorphism detection. The vertex characteristic is firstly defined in this paper that is the core of the enumeration algorithm. This paper also gives an example of the application for the algorithm.
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.
