We obtain inequalities involving many topological indices in classical graph products by using the f-polynomial. In particular, we work with lexicographic product, Cartesian sum and first Zagreb, forgotten, inverse degree lordeg indices.

For any graphs G of order n, the spanning tree packing number, denoted by, a graph is maximum number edge disjoint contained in G. In this study determine lexicographic product resulting from two path graphs.

In this paper, we investigate the concept of resolving dominating set in a graph. particular, characterize sets join, corona and lexicographic product two graphs determine domination number these graphs.

The authors exhibit an abelian group not embeddable in a product of copies of Z (the integers) but totally orderable so that every covering pair of convex subgroups has archimedean quotient isomorphic to Z (= g.d.), thus furnishing a counterexample to Théorème 4 on p. 53 of [21]; then go on to show that every countable g.d. group is algebraically free (§4); and purport to show it also embeddabl...

The sigma coindex is defined as the sum of squares differences between degrees all nonadjacent vertex pairs. In this paper, we propose some mathematical properties coindex. Later, present precise results for coindices various graph operations such tensor product, Cartesian lexicographic disjunction, strong union, join, and corona product.