Abstract
AbstractCharacteristic polynomials of acyclic carbon chains (Huckel trees) are treated in a systematic way. Formulas of coefficients (ak) of the polynomial are obtained in terms of connectivities that were introduced for dealing with moments in a previous paper. Based on the meaning of ak, a graph‐theoretical analysis is given such that ak can be expressed as a linear combination of binomial factors specified by a set of graphs containing ½k edges. The numerical relationship is disclosed between each binomial factor and its specified graph. This stimulates the proposal of a novel approach for evaluating ak by simply collecting the graph set of defnite edges. The approach is equally applicable for the evaluation of matching polynomials of cyclic systems and extendable to the investigation of general trees.
Sign-in/Register to access full text options 
Free) 
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 call
