Resumen de Some Invariants of Flower Graph

Abaid Rehman Virk, Muhammad Quraish

• Let G be a graph and let mi j(G),i, j ≥ 1, represents the number of edge of G, where i and j are the degrees of vertices uand 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 differentZagreb indices, harmonic indices and forgotten index.