The bounds of vertex Padmakar-Ivan index on k-trees

Authors

Shaohui Wang, Texas A and M International University
Zehui Shao, Guangzhou University
Jia Bao Liu, Anhui Jianzhu University
Bing Wei, University of Mississippi

Document Type

Article

Publication Date

4-1-2019

Abstract

© 2019 by the authors. The Padmakar-Ivan (PI) index is a distance-based topological index and a molecular structure descriptor, which is the sum of the number of vertices over all edges uv of a graph such that these vertices are not equidistant from u and v. In this paper, we explore the results of PI-indices from trees to recursively clustered trees, the k-trees. Exact sharp upper bounds of PI indices on k-trees are obtained by the recursive relationships, and the corresponding extremal graphs are given. In addition, we determine the PI-values on some classes of k-trees and compare them, and our results extend and enrich some known conclusions.

Relational Format

journal article

Recommended Citation

Wang, S., Shao, Z., Liu, J.-B., & Wei, B. (2019). The Bounds of Vertex Padmakar–Ivan Index on k-Trees. Mathematics, 7(4), 324. https://doi.org/10.3390/math7040324

DOI

10.3390/math7040324

Accessibility Status

Searchable text