Affiliation:
1. Institute of Nanoscience and Nanotechnology, University of Kashan, Kashan 87317-51167, I. R. Iran
Abstract
Let G be a graph, e = uv ∈ E( G ), nu(e) be the number of vertices of G lying closer to u than to v and nv(e) be the number of vertices of G lying closer to v than to u. The vertex PI and Szeged polynomials of the graph G are defined as PI v( G ,x) = ∑e = uv xnu (e) + nv (e) and Sz ( G ,x) = ∑e = uv xnu (e)nv (e), respectively. In this paper, these counting polynomials for an infinite family of IPR fullerenes are computed.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computational Theory and Mathematics,Physical and Theoretical Chemistry,Computer Science Applications
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Novel results on entropy-based measures of fullerenes;Fullerenes, Nanotubes and Carbon Nanostructures;2020-09-14
2. THE MOSTAR INDEX OF FULLERENES IN TERMS OF AUTOMORPHISM GROUP;Facta Universitatis, Series: Mathematics and Informatics;2020-04-06
3. Atlas of ρ, ρE, and TM–EC for Fullerenes Isomers;Sustainable Nanosystems Development, Properties, and Applications;2017
4. Comparing Fullerenes by Spectral Moments;Journal of Nanoscience and Nanotechnology;2016-03-01
5. Topological Indices of 3-Generalized Fullerenes;Distance, Symmetry, and Topology in Carbon Nanomaterials;2016