Article
Some Invariants of Flower Graph
Authors
and
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.
Keywords
Topological index, Flower Graph, Zagreb index
Citation
Virk, A. U. R. & Quraish, M. (2018). Some invariants of flower graph. Applied Mathematics and Nonlinear Sciences, 3(2), 427–432. https://doi.org/10.21042/AMNS.2018.2.00033
A. U. R. Virk and M. Quraish, “Some invariants of flower graph,” Applied Mathematics and Nonlinear Sciences, vol. 3, no. 2, pp. 427–432, 2018, doi: 10.21042/AMNS.2018.2.00033.
Virk AUR, Quraish M. Some invariants of flower graph. Applied Mathematics and Nonlinear Sciences. 2018;3(2):427–432. doi:10.21042/AMNS.2018.2.00033.
Virk, A. U. R. and Quraish, M. (2018), ‘Some invariants of flower graph’, Applied Mathematics and Nonlinear Sciences, 3(2), pp. 427–432. Available at: https://doi.org/10.21042/AMNS.2018.2.00033.
Virk, Abaid ur Rehman, and Muhammad Quraish. “Some Invariants of Flower Graph.” Applied Mathematics and Nonlinear Sciences, vol. 3, no. 2, 2018, pp. 427–432. https://doi.org/10.21042/AMNS.2018.2.00033.
Virk, Abaid ur Rehman, and Muhammad Quraish. “Some Invariants of Flower Graph.” Applied Mathematics and Nonlinear Sciences 3, no. 2 (2018): 427–432. https://doi.org/10.21042/AMNS.2018.2.00033.
Export citation
Published by: Engineering Journals
