Crossref
An upper bound for the energy of graphs.
International Journal of Mathematics and Computer Science · 2026 · 237-239
DOI: 10.69793/ijmcs/02.2026/rakshith ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Mathematics and Computer Science, 2026. Verfasst von B. Rakshith.
Abstract (Originalsprache)
In this article, we obtain an upper bound for the energy of a non-singular graph G based on average of k singular values of A(G), determinant of A(G), and the size of the graph G.
Zitieren
APA
Rakshith, B. (2026). An upper bound for the energy of graphs. International Journal of Mathematics and Computer Science, 237-239. https://doi.org/10.69793/ijmcs/02.2026/rakshith
Vancouver
Rakshith B. An upper bound for the energy of graphs. International Journal of Mathematics and Computer Science. 2026:237-239. doi:10.69793/ijmcs/02.2026/rakshith
BibTeX
@article{Rakshith2026,
author = {Rakshith, B.},
title = {An upper bound for the energy of graphs},
journal = {International Journal of Mathematics and Computer Science},
year = {2026},
pages = {237--239},
doi = {10.69793/ijmcs/02.2026/rakshith}
}
EUVIMED