Abstract
Graph theory can be used efficiently for both kinematic and dynamics analysis of mechanical structures. One of the most important and difficult issues in graphs theory-based structures design is graphs isomorphism discernment. The problem is vital for graph theory-based kinematic structures enumeration, which is known to be nondeterministic polynomial-complete problem. To solve the problem, a Hopfield neural networks (HNN) model is presented and some operators are improved to prevent premature convergence. By comparing with genetic algorithm, the computation times of the HNN model shows less affection when the number of nodes were enhanced. It is concluded that the algorithm presented in this paper is efficient for large-scale graphs isomorphism problem.
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.
