Some Invariants of Flower Graph
- Autores: Abaid Rehman Virk, Muhammad Quraish
- Localización: Applied Mathematics and Nonlinear Sciences, ISSN-e 2444-8656, Vol. 3, Nº. 2, 2018, págs. 427-432
- Idioma: inglés
- DOI: 10.21042/amns.2018.2.00033
- Enlaces
-
Resumen
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.
¿Es nuevo? Regístrese
Ventajas de registrarse
