LI, RAO (2018) A SHARP UPPER BOUND FOR THE ENERGY OF A CONNECTED GRAPH. Asian Journal of Mathematics and Computer Research, 25 (6). pp. 367-370.
Full text not available from this repository.Abstract
The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the graph. A new upper bound for the energy of a connected graph is presented in this note. The upper bound involves the chromatic number and the rank of the graph.
| Item Type: | Article |
|---|---|
| Subjects: | Apsci Archives > Mathematical Science |
| Depositing User: | Unnamed user with email support@apsciarchives.com |
| Date Deposited: | 13 Jan 2024 04:31 |
| Last Modified: | 13 Jan 2024 04:31 |
| URI: | http://eprints.go2submission.com/id/eprint/2413 |
Actions (login required)
- View Item