• Two new graph-theoretical methods for generation of eigenvectors of chemical graphs

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Graph-theory; Ulam’s subgraphs; characteristic polynomials; eigenvectors; multiplicity of degenerate eigenvalues; complete graphs; cofactor polynomials

    • Abstract


      Two new graph-theoretical methods, (A) and (B), have been devised for generation of eigenvectors of weighted and unweighted chemical graphs. Both the methods show that not only eigenvalues but also eigenvectors have full combinatorial (graph-theoretical) content. Method (A) expresses eigenvector components in terms of Ulam’s subgraphs of the graph. For degenerate eigenvalues this method fails, but still the expressions developed yield a method for predicting the multiplicities of degenerate eigenvalues in the graph-spectrum. Some well-known results about complete graphs (Kn) and annulenes (Cn), viz. (i)Kn has an eigenvalue −1 with (n−1)-fold degeneracy and (ii) Cn cannot show more than two-fold degeneracy, can be proved very easily by employing the eigenvector expression developed in method (A). Method (B) expresses the eigenvectors as analytic functions of the eigenvalues using the cofactor approach. This method also fails in the case of degenerate eigenvalues but can be utilised successfully in case of accidental degeneracies by using symmetry-adapted linear combinations. Method (B) has been applied to analyse the trend in charge-transfer absorption maxima of the some molecular complexes and the hyperconjugative HMO parameters of the methyl group have been obtained from this trend.

    • Author Affiliations


      Asok K Mukherjee1 Kali Kinkar Datta1

      1. Chemistry Department, Burdwan Raj College, Burdwan - 713 104, India
    • Dates

  • Journal of Chemical Sciences | News

© 2021-2022 Indian Academy of Sciences, Bengaluru.