Abstract
The idea of eigen-solution "persistence" from a suitable subgraph into a parent (molecular) graph G are formalized, in different ways for different cases. Most of it is based on the identification of suitably separated subgraphs sharing common eigenvalues, such that the subgraphs are all isomorphic. We recall Hall’s embedding method to identify adjacency-matrix eigen-solutions of a graph G as persistent from suitable disjoint subgraphs. General rigorous results are obtained for special embeddings, including cases where the subgraphs need not be isomorphic, but rather only share common eigenvalues. The question of accidental degeneracies is addressed, as well as the role of some sort of "local symmetries". Especially the mode of interconnection amongst a suitable family of subgraphs is addressed.
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 callMore From: Match Communications in Mathematical and in Computer Chemistry
Disclaimer: 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.
