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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Mathematics: Computer Systems Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
