BOUND INEQUALITIES ON MINIMUM COVERING ENERGY OF GRAPHS

BOUND INEQUALITIES ON MINIMUM COVERING ENERGY OF GRAPHS

  • Shivakumar Swamy C S Government College for Women Mandya 571401 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.
DOI: https://doi.org/10.5269/bspm.75933

Resumo

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

Não há dados estatísticos.
Publicado
2025-09-18
Edição
v. 43 (2025)
Seção
Artigos

Copyright (c) 2025 Boletim da Sociedade Paranaense de Matemática

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).

The journal utilize the Creative Common Attribution (CC-BY 4.0).

 

Crossref
Scopus
Google Scholar
Europe PMC