Abstract
In this article the idea of graph coloration from spectral graph theory is employed in conjunction with group theoretical concepts for efficient eigensolution of adjacency matrices of graphs. The application of the method is extended to free vibration analysis of symmetric finite element problems, constructing a graph model of the problem in a local symmetry adapted coordinate system.
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.
