Affiliation:
1. University of Management and Technology , Lahore , Pakistan
2. Department of Mathematics, The University of Lahore Pakpattan Campus , Lahore Pakistan
Abstract
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.
Subject
Applied Mathematics,Engineering (miscellaneous),Modeling and Simulation,General Computer Science
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献