Abstract
Let G be a graph and let m ij ( G ) , i, j ≥ 1, represents the number of edge of G , where i and j are the degrees of vertices u and v respectively. In this article, we will compute different polynomials of flower graph f ( n×m ), namely M polynomial and Forgotten polynomial. These polynomials will help us to find many degree based topological indices, included different Zagreb indices, harmonic indices and forgotten index.

This publication has 14 references indexed in Scilit: