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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
