Abstract
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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have