{"title":"图的组合矩阵的能量","authors":"B. K. Divyashree, R. Jagadeesh, .. Siddabasappa","doi":"10.56557/ajomcor/2022/v29i17574","DOIUrl":null,"url":null,"abstract":"Let G= (V, E) be a simple connected graph. In this paper, we have evaluated the energies of combinatorial matrices. We have two types of path defined matrices that is distance path and detour path the elements of these matrices are found combinatorially from the traditional distance and detour matrices. Here, we have calculated energies of standard graphs for both distance path and detour path matrices. Upper and lower bounds for these combinatorial matrices are also determined.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ENERGY OF COMBINATORIAL MATRICES OF GRAPHS\",\"authors\":\"B. K. Divyashree, R. Jagadeesh, .. Siddabasappa\",\"doi\":\"10.56557/ajomcor/2022/v29i17574\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G= (V, E) be a simple connected graph. In this paper, we have evaluated the energies of combinatorial matrices. We have two types of path defined matrices that is distance path and detour path the elements of these matrices are found combinatorially from the traditional distance and detour matrices. Here, we have calculated energies of standard graphs for both distance path and detour path matrices. Upper and lower bounds for these combinatorial matrices are also determined.\",\"PeriodicalId\":200824,\"journal\":{\"name\":\"Asian Journal of Mathematics and Computer Research\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-02-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asian Journal of Mathematics and Computer Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.56557/ajomcor/2022/v29i17574\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Journal of Mathematics and Computer Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.56557/ajomcor/2022/v29i17574","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Let G= (V, E) be a simple connected graph. In this paper, we have evaluated the energies of combinatorial matrices. We have two types of path defined matrices that is distance path and detour path the elements of these matrices are found combinatorially from the traditional distance and detour matrices. Here, we have calculated energies of standard graphs for both distance path and detour path matrices. Upper and lower bounds for these combinatorial matrices are also determined.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
