{"title":"半图的最小覆盖能","authors":"Ardhendu Kumar Nandi, S. Nath, Niva Rani Nath","doi":"10.46300/91019.2023.10.4","DOIUrl":null,"url":null,"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.","PeriodicalId":14365,"journal":{"name":"International journal of pure and applied mathematics","volume":"104 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Minimum Covering Energy of Semigraph\",\"authors\":\"Ardhendu Kumar Nandi, S. Nath, Niva Rani Nath\",\"doi\":\"10.46300/91019.2023.10.4\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":14365,\"journal\":{\"name\":\"International journal of pure and applied mathematics\",\"volume\":\"104 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of pure and applied mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46300/91019.2023.10.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of pure and applied mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46300/91019.2023.10.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
