Abstract
We list uses of, and the computational methods for the characteristic polynomial of a (chemical) graph. Pour computational methods are singled out for more detailed presentation. These are the graphical methods of Sachs, the recurrence formulae for several classes of simple graphs, the method based on Ulam subgraphs, and the Le Verrier — Faddeev — Franic recursive method. The latter method appears, at present, to be the most efficient procedure for the computation of the characteristic polynomials of graphs of sizes with up to even a few hundred sites.
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.
