M-Polynomials of New Families of Graphs
No Thumbnail Available
Date
2019
Journal Title
Journal ISSN
Volume Title
Publisher
Library Information Services, COMSATS University Islamabad, Lahore Campus
Abstract
In this thesis, we calculated the M-polynomials for uniformly k-subdivided graphs and
line graphs of k-subdivided graphs of connected families of the tetracanic nanotubes
and nanotori. Then wecalculated degree based topological indices for the k-subdivided
graphs and the line graphs of the k-subdivided graphs of nanotubes by using the means
of M-polynomials of the graphs. The precise and definite formulas of these indices
for different families of nanotubes are presented in this section. We also compute M
polynomials for the sum of two graphs G+H, k-subdivided graph of G denoted by
G(k) and line graph of G(k), for k ≥ 1
Description
Keywords
department of mathematics, M-polynomials for uniformly k-subdivided graphs and line graphs of k-subdivided graphs of connected families of the tetracanic nanotubes and nanotori. Then wecalculated degree based topological indices for the k-subdivided graphs and the line graphs of the k-subdivided graphs of nanotubes by using the means of M-polynomials of the graphs.