{"title":"计算三元组上图的seeged索引","authors":"M. Darafsheh, R. Modabernia, M. Namdari","doi":"10.22052/IJMC.2017.80007.1275","DOIUrl":null,"url":null,"abstract":"ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define three types of intersection graphs with vertex set V. These graphs are denoted by and we will find their Szeged indices.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":"50 1","pages":"175-180"},"PeriodicalIF":1.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Computing Szeged Index of Graphs on Triples\",\"authors\":\"M. Darafsheh, R. Modabernia, M. Namdari\",\"doi\":\"10.22052/IJMC.2017.80007.1275\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define three types of intersection graphs with vertex set V. These graphs are denoted by and we will find their Szeged indices.\",\"PeriodicalId\":14545,\"journal\":{\"name\":\"Iranian journal of mathematical chemistry\",\"volume\":\"50 1\",\"pages\":\"175-180\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iranian journal of mathematical chemistry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22052/IJMC.2017.80007.1275\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian journal of mathematical chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22052/IJMC.2017.80007.1275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define three types of intersection graphs with vertex set V. These graphs are denoted by and we will find their Szeged indices.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
