Construction of characteristic polynomial of reciprocal graphs from the number of pendant vertices

A method for construction of the characteristic polynomial (CP) coefficients of the three classes of reciprocal graphs, viz., L_n + n(p), C_n + n(p), and K_1,n?1 + n(p), has been developed that requires only the value of n. The working formulas have been expressed in matrix product form, computer programs for which can easily be developed. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2005