The M-Polynomial and Nirmala index of Certain Composite Graphs

The M-Polynomial and Nirmala index are considered as two of the most recent found and important subjects in chemical graph theory. In this paper we drive and prove the computing formula of Nirmala index from the M-Polynomial, then compute the M-Polynomial for some certain composite graphs, and the N...

Full description

Saved in:
Bibliographic Details
Published inTikrit Journal of Pure Science Vol. 27; no. 3; pp. 92 - 101
Main Authors Akar H. Karim, Nabeel E. Arif, Ayad M. Ramadan
Format Journal Article
LanguageEnglish
Published Tikrit University 29.11.2022
Subjects
Cluster graphs
Corona
Join
M-Polynomial
Nirmala Index
Online AccessGet full text
ISSN1813-1662
2415-1726
DOI10.25130/tjps.v27i3.45

Cover

More Information
Summary:The M-Polynomial and Nirmala index are considered as two of the most recent found and important subjects in chemical graph theory. In this paper we drive and prove the computing formula of Nirmala index from the M-Polynomial, then compute the M-Polynomial for some certain composite graphs, and the Nirmala index via the computed M-Polynomial. The composite graphs are new defined graphs Kn(Pt)Km , Cn(e)Kn , and others obtained from simple graphs by certain graph operations such as join, corona, and cluster of any graph with some special graphs such as complete, path, …etc
ISSN:1813-1662
2415-1726
DOI:10.25130/tjps.v27i3.45