On Minimum Covering Energy of Semigraph

Abstract

A compromise between the concept of graph and hypergraph is semigraph. This paper introduced the concept of minimum covering matrix and minimum covering energy of a semigraph G. The minimum covering energy is the summation of singular values of the minimum covering matrix. Upper and lower bounds for minimum covering energy are established and also derive some relationship between minimum covering energy and energy of semigraph G.