{"title":"单基因半群的笛卡尔强积图下的和连通性指数","authors":"R. Rajadurai, G. Sheeja","doi":"10.28924/2291-8639-21-2023-94","DOIUrl":null,"url":null,"abstract":"This field’s main feature is to implement the sum connectivity index method. This sum connectivity index method can solve the monogenic semigroups under the cartesian and strong products. We will define for an undirected graph as SCI(GMS)=Σuv∈E(GMS) [dGMS(u)+dGMS(v)]−1/2, where dGMS(u) and dGMS(v) are degree of u and v in GMS respectively. Further, we investigate two different algorithms concerning topological index for computing cartesian and strong products of a monogenic semigroup with a detailed example.","PeriodicalId":45204,"journal":{"name":"International Journal of Analysis and Applications","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sum Connectivity Index Under the Cartesian and Strong Products Graph of Monogenic Semigroup\",\"authors\":\"R. Rajadurai, G. Sheeja\",\"doi\":\"10.28924/2291-8639-21-2023-94\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This field’s main feature is to implement the sum connectivity index method. This sum connectivity index method can solve the monogenic semigroups under the cartesian and strong products. We will define for an undirected graph as SCI(GMS)=Σuv∈E(GMS) [dGMS(u)+dGMS(v)]−1/2, where dGMS(u) and dGMS(v) are degree of u and v in GMS respectively. Further, we investigate two different algorithms concerning topological index for computing cartesian and strong products of a monogenic semigroup with a detailed example.\",\"PeriodicalId\":45204,\"journal\":{\"name\":\"International Journal of Analysis and Applications\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Analysis and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.28924/2291-8639-21-2023-94\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Analysis and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.28924/2291-8639-21-2023-94","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Sum Connectivity Index Under the Cartesian and Strong Products Graph of Monogenic Semigroup
This field’s main feature is to implement the sum connectivity index method. This sum connectivity index method can solve the monogenic semigroups under the cartesian and strong products. We will define for an undirected graph as SCI(GMS)=Σuv∈E(GMS) [dGMS(u)+dGMS(v)]−1/2, where dGMS(u) and dGMS(v) are degree of u and v in GMS respectively. Further, we investigate two different algorithms concerning topological index for computing cartesian and strong products of a monogenic semigroup with a detailed example.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
