MINIMUM COVERING GUTMAN ENERGY OF A GRAPH
| Autor: | Roshan Sara Philipose, Sarasija P B |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Combinatorics
Graph energy 010102 general mathematics 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 02 engineering and technology Creative commons 0101 mathematics 01 natural sciences Upper and lower bounds Graph Eigenvalues and eigenvectors Mathematics |
| Zdroj: | MATTER: International Journal of Science and Technology. 5:01-11 |
| ISSN: | 2454-5880 |
| Popis: | The concept of a new kind of graph energy, namely, minimum covering energy, denoted by E c (G), was introduced by Chandrashekar Adiga et.al in 2012. The Gutman energy is the sum of the absolute values of the eigenvalues obtained from the Gutman matrix. In this paper, we depict the minimum covering Gutman energy of a graph which can be defined as sum of the absolute values of the minimum covering Gutman eigenvalues obtained from the minimum covering Gutman matrix of a graph. Further, we establish the upper and lower bounds for minimum covering Gutman energy. Article DOI: https://dx.doi.org/10.20319/mijst.2019.51.0111 This work is licensed under the Creative Commons Attribution-Non-commercial 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/4.0/ or send a letter to Creative Commons, PO Box 1866, Mountain View, CA 94042, USA. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|