Average measures in polymer graphs. Issue 1 (2nd January 2021)

• Record Type: Journal Article
• Authors: Bhutani, Kiran; Kalpathy, Ravi; Mahmoud, Hosam
• Is Part Of: International journal of computer mathematics. Volume 6:Issue 1(2021)
• Page Start: 37
• Page End: 53
• Publication Date: 2021-01-02
• Subjects: Network -- polymer -- degree profile -- depth -- diameter; Primary: 05082 -- 05C12 -- 90B15 -- Secondary: 60C05; Computer systems -- Periodicals; Computer systems; Periodicals; 004
• DOI: 10.1080/23799927.2020.1860134
• Languages: English
• ISSNs: 2379-9927

Abstract

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.