Abstract
Generalized graphs represent Huckel-type and Mobius-type polycyclic conjugated systems. We show that the number of generalized graphs with different spectra for a given parent graph is not larger than 2 N(R) and is equal to 2 N(R) if no two rings are equivalent,N(R) being the number of rings (fundamental circuits) in the parent graph. We demonstrate that the rule for the stability of generalized graphs, proved in a previuos paper, and the information on the relative magnitudes of the effects of individual circuits enable one to predict the stabilities of generalized graphs without performing numerical calculations.
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.
