BOUND INEQUALITIES ON MINIMUM COVERING ENERGY OF GRAPHS

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.

Abstract

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.

Downloads

Download data is not yet available.
Published
2025-09-18
Section
Research Articles