Some Invariants of Flower Graph
Open Access
- 1 July 2018
- journal article
- Published by Erdos Publish House in Applied Mathematics and Nonlinear Sciences
- Vol. 3 (2) , 427-432
Abstract
Let G be a graph and let m ij ( 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
This publication has 14 references indexed in Scilit:
- Some Computational Aspects of Boron Triangular NanotubesSymmetry, 2017
- M-Polynomial and Degree-Based Topological Indices of Polyhex NanotubesSymmetry, 2016
- Some Invariants of Circulant GraphsSymmetry, 2016
- M-Polynomial and Related Topological Indices of Nanostar DendrimersSymmetry, 2016
- A general modeling of some vertex-degree based topological indices in benzenoid systems and phenylenesComputers & Mathematics with Applications, 2011
- On a class of distance-based molecular structure descriptorsChemical Physics Letters, 2011
- On Topological Indices, Boiling Points, and CycloalkanesJournal of Chemical Information and Computer Sciences, 1999
- The Clar covering polynomial of hexagonal systems IDiscrete Applied Mathematics, 1996
- A Comparison of the Schultz Molecular Topological Index with the Wiener IndexJournal of Chemical Information and Computer Sciences, 1996
- Structural Determination of Paraffin Boiling PointsJournal of the American Chemical Society, 1947