BOUND INEQUALITIES ON MINIMUM COVERING ENERGY OF GRAPHS
BOUND INEQUALITIES ON MINIMUM COVERING ENERGY OF GRAPHS
Résumé
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.
Téléchargements
Les données sur le téléchargement ne sont pas encore disponible.
Publiée
2025-09-18
Numéro
Rubrique
Research Articles
Copyright (c) 2025 Boletim da Sociedade Paranaense de Matemática

Ce travail est disponible sous la licence Creative Commons Attribution 4.0 International .
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).



