Let G be a prolific graph, by which we mean finite connected simple graph is not isomorphic to cycle nor path the star K1,3. The line-graph of G, denoted L(G), defined having its vertex-set equal edge-set and two vertices L(G) are adjacent if corresponding edges in G. For positive integer k, iterated Lk(G) recursively Lk(G)=L(Lk−1(G)). In this paper shall consider fifteen well-known parameters ...