BOUNDS INEQUALITY OF MAXIMUM COVERING ENERGY FOR SEMIGRAPHS
BOUNDS INEQUALITY OF MAXIMUM COVERING ENERGY FOR SEMIGRAPHS
Abstract
The concept of energy plays a significant role in spectral graph theory
and its applications. Recently, various energy concepts based on covering parameters
have been introduced for graphs and semigraphs. In this paper, we introduce the
notion of maximum covering energy of a semigraph and establish several upper and
lower bound inequalities. These bounds are expressed in terms of structural invari-
ants such as the number of vertices, edges, covering number, and maximum degree.
Illustrative examples are provided to demonstrate the sharpness of the results.
Downloads
Copyright (c) 2026 Boletim da Sociedade Paranaense de Matemática
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).
