# M-Polynomial of Some Operations of Path and K-Banhatti Indices

## Abstract

Among the introduced graph algebraic polynomials, one of the most intriguing polynomials is M-Polynomial, which is a unified way tool to compute degree-based topological indices. Graph operations are important in many applications of graph theory, because we can generate huge graphs from small graphs by using graph operations. Till now, many researchers compute degree-based topological indices of various simple and connected graphs via M-Polynomial approach. However, no one has paid attention to the M-Polynomial of numerous graph operations. In this article, we attempt to compute the M-Polynomial of different graph operations on some paths of different orders. Further, we evaluate the K-Banhatti group of indices for the considered graph operations using M-Polynomial. This article also reports some graphical comparison among the computed indices for the graph operations. The findings of our computations may be useful in locating some buried information in a variety of large graphs.

## Downloads

## Published

## How to Cite

*Mathematical Statistician and Engineering Applications*,

*71*(3s3), 38–55. Retrieved from https://www.philstat.org.ph/index.php/MSEA/article/view/346