For a nontrivial graph G, its first Zagreb coindex is defined as the sum of degree sum over all non-adjacent vertex pairs in G and the second Zagreb coindex is defined as the sum of degree product over all non-adjacent vertex pairs in G. Till now, established results concerning Zagreb coindices are mainly related to composite graphs and extremal values of some special graphs. The existing liter...

In graph theory, lattices are used when some structural part of the repeats itself finitely or infinitely many times. They have applications in complex analysis and geometry mathematics, also natural chemical theory. As a lattice can be taken as graph, it is possible to use them study large networks. Recently, topological indices pentagonal chains studied here, we double similarly that work. We...