Neighbors degree sum energy of graphs
| Autor: | R. B. Jummannaver, H. S. Boregowda |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Vertex (graph theory)
010304 chemical physics Correlation coefficient Degree (graph theory) Applied Mathematics 0102 computer and information sciences Type (model theory) 01 natural sciences Combinatorics Computational Mathematics Matrix (mathematics) Graph energy 010201 computation theory & mathematics 0103 physical sciences Energy (signal processing) Eigenvalues and eigenvectors Mathematics |
| Zdroj: | Journal of Applied Mathematics and Computing. 67:579-603 |
| ISSN: | 1865-2085 1598-5865 |
| Popis: | In this paper, we introduce a new matrix for a graph G in which i th row sum and i th column sum are both equal to neighbors degree sum of i th vertex and define a new variant of graph energy called neighbors degree sum energy $$E_{N} (G)$$ of a graph G. The striking feature of this new matrix is that it is related with some well known degree based topological indices like Zagreb type indices, forgotten indices, etc. When $$E_N(G)$$ values of some molecules containing hetero atoms are correlated with their total $$\pi $$ –electron energy, we got a good correlation with the correlation coefficient $$r=0.982$$ . $$E_N(G)$$ values of some selected 25 polyaromatic hydrocarbons also showed excellent correlation with their $$\pi $$ –electron energy values with the correlation coefficient $$r=0.997$$ . Further, we computed neighbors degree sum energy of some standard classes of graphs and established some bounds and characterizations on largest eigenvalue of N(G) and neighbors degree sum energy of graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink