Search Results

You are looking at 1 - 1 of 1 items for

  • Author: Muhammad Quraish x
Clear All Modify Search
Open access

Abaid ur Rehman Virk and Muhammad Quraish

Abstract

Let G be a graph and let mij(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.