BOUND INEQUALITIES ON MINIMUM COVERING ENERGY OF GRAPHS

Shivakumar Swamy C S; Smitha M; Honnegowda C K; Ashawini M P

doi:10.5269/bspm.75933

BOUND INEQUALITIES ON MINIMUM COVERING ENERGY OF GRAPHS

Shivakumar Swamy C S Government First Grade College , Krishnarajapete, MAndya 571426 https://orcid.org/0009-0002-8393-1144
Smitha M Departme Mathematics, JSS Science and Technology University, Mysuru.
Honnegowda C K Government First Grade Collegent of, Krishnarajapete, Mandya, Karnataka, India
Ashawini M P Departme Mathematics,Vidya Vikas Institute of Engineering and Technology,Mysuru, Karnataka, India.

Resumen

The sum of the absolute values of all Minimum Covering eigenvalues $E_{mc}\mathfrak{(G)}$, of graph $\mathfrak{G}$ represents the Minimum Covering energy of that graph. A few upper and lower constraints on the minimum Covering energy are obtained in this study.