{"title":"聚合物图中的平均测量值","authors":"K. R. Bhutani, Ravi Kalpathy, H. Mahmoud","doi":"10.1080/23799927.2020.1860134","DOIUrl":null,"url":null,"abstract":"We introduce polymer graphs, a class of fast-growing networks endowed with a designated hook. We study the structure of these polymer graphs by investigating numerous average measures such as the average number of nodes of the smallest degree, the average depth of a randomly chosen node, the average degree in the graph, the average order of the sub-polymer graphs hooked into the nodes, the average eccentricity of nodes, and the average diameter of the polymer graph. The construction of polymer graphs presented here relates to the step-growth polymerization.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2020-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Average measures in polymer graphs\",\"authors\":\"K. R. Bhutani, Ravi Kalpathy, H. Mahmoud\",\"doi\":\"10.1080/23799927.2020.1860134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce polymer graphs, a class of fast-growing networks endowed with a designated hook. We study the structure of these polymer graphs by investigating numerous average measures such as the average number of nodes of the smallest degree, the average depth of a randomly chosen node, the average degree in the graph, the average order of the sub-polymer graphs hooked into the nodes, the average eccentricity of nodes, and the average diameter of the polymer graph. The construction of polymer graphs presented here relates to the step-growth polymerization.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2020-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2020.1860134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2020.1860134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
We introduce polymer graphs, a class of fast-growing networks endowed with a designated hook. We study the structure of these polymer graphs by investigating numerous average measures such as the average number of nodes of the smallest degree, the average depth of a randomly chosen node, the average degree in the graph, the average order of the sub-polymer graphs hooked into the nodes, the average eccentricity of nodes, and the average diameter of the polymer graph. The construction of polymer graphs presented here relates to the step-growth polymerization.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
