Abstract
The study of complex networks with topological indices has flourished in recent years. The aim of this paper is to study the limiting behaviors of Gutman and Schultz indices in random polygonal chains, whose graph-theoretic mathematical properties and their future applications have attracted the interest of scientists. By applying the concepts of symmetry and asymptotics as well as the knowledge of probability theory, we obtain explicit analytic expressions for the Gutman and Schultz indices of n random 2k-vertex chains and prove that they converge to a normal distribution, which contributes to a deeper understanding of the structural features of random polygonal chains and plays a crucial role in the study of the limiting behavior of topological indices and their applications.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
