Minimal Energy Tree with 4 Branched Vertices
The energy of a graph is defined as the sum of absolute values of the eigenvalues of its adjacency matrix. Let Ω(n,4) be the class of all trees of order n and having 4 branched vertices. In this paper, the minimal energy tree in the class Ω(n,4) is found.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2019-04-01
|
| Series: | Open Chemistry |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/chem-2019-0013 |