3.8 Article

Tripartite Graphs with Energy Aggregation

Journal

BOLETIM SOCIEDADE PARANAENSE DE MATEMATICA
Volume 38, Issue 7, Pages 149-167

Publisher

SOC PARANAENSE MATEMATICA
DOI: 10.5269/bspm.v38i7.44463

Keywords

Spectrum; Tripartite graph; Adjacency matrix (A); Laplacian matrix (L); Signless matrix (S); Characteristic polynomial (CH)

Categories

Ask authors/readers for more resources

The aggregate of the absolute values of the graph eigenvalues is called the energy of a graph. It is used to approximate the total pi-electron energy of molecules. Thus, finding a new mechanism to calculate the total energy of some graphs is a challenge; it has received a lot of research attention. We study the eigenvalues of a complete tripartite graph T-i,T-i,T-n -2i, for n >= 4, based on the adjacency, Laplacian, and signless Laplacian matrices. In terms of the degree sequence, the extreme eigenvalues of the irregular graphs energy are found to characterize the component with the maximum energy. The chemical HMO approach is particularly successful in the case of the total pi-electron energy. We showed that some chemical components are equienergetic with the tripartite graph. This discovering helps easily to derive the HMO for most of these components despite their different structures.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available