Abstract
In graph theory, lattices are used when some structural part of the graph repeats itself finitely or infinitely many times. They have applications in complex analysis and geometry in mathematics, and also natural applications in chemical graph theory. As a lattice can be taken as a graph, it is also possible to use them in the study of large networks. Recently, some topological graph indices of pentagonal chains is studied and here, we study some topological graph indices of pentagonal double chains similarly to that work. We make use of the vertex and edge partitions of these graphs and calculate their indices by means of these partitions and combinatorial methods.
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.
