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

Mandal Bholanath | Zendy; Banerjee Manas | Zendy; Mukherjee Asok K. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

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

Author(s) -

Mandal Bholanath,

Banerjee Manas,

Mukherjee Asok K.

Publication year - 2004

Publication title -

international journal of quantum chemistry

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.484

H-Index - 105

eISSN - 1097-461X

pISSN - 0020-7608

DOI - 10.1002/qua.20266

Subject(s) - reciprocal , combinatorics , characteristic polynomial , mathematics , product (mathematics) , polynomial , matrix (chemical analysis) , value (mathematics) , discrete mathematics , chemistry , geometry , mathematical analysis , philosophy , linguistics , statistics , chromatography

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

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research