—The graphs which are used in this paper simple, finite and undirected. The first second Zagreb indices for every non-adjacent vertices (also called coindices) dependent only on the degrees interspersed operations of addition multiplication, respectively, vertices. number edges incident vertex v a graph G is degree two u if it’s no common edge between them. In paper, we found coindices chains e...

a recently published paper [t. došlić, this journal 3 (2012) 25-34] considers the zagrebindices of benzenoid systems, and points out their low discriminativity. we show thatanalogous results hold for a variety of vertex-degree-based molecular structure descriptorsthat are being studied in contemporary mathematical chemistry. we also show that theseresults are straightforwardly obtained by using...