IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i4p324-d218874.html
   My bibliography  Save this article

The Bounds of Vertex Padmakar–Ivan Index on k -Trees

Author

Listed:
  • Shaohui Wang

    (Department of Mathematics and Physics, Texas A&M International University, Laredo, TX 78041, USA)

  • Zehui Shao

    (Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China)

  • Jia-Bao Liu

    (School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China)

  • Bing Wei

    (Department of Mathematics, The University of Mississippi, University, MS 38677, USA)

Abstract

The Padmakar–Ivan ( P I ) index is a distance-based topological index and a molecular structure descriptor, which is the sum of the number of vertices over all edges u v of a graph such that these vertices are not equidistant from u and v . In this paper, we explore the results of P I -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 P I -values on some classes of k -trees and compare them, and our results extend and enrich some known conclusions.

Suggested Citation

  • Shaohui Wang & Zehui Shao & Jia-Bao Liu & Bing Wei, 2019. "The Bounds of Vertex Padmakar–Ivan Index on k -Trees," Mathematics, MDPI, vol. 7(4), pages 1-10, April.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:4:p:324-:d:218874
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/4/324/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/4/324/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wang, Shaohui & Wang, Chunxiang & Liu, Jia-Bao, 2018. "On extremal multiplicative Zagreb indices of trees with given domination number," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 338-350.
    2. John Estes & Bing Wei, 2014. "Sharp bounds of the Zagreb indices of k-trees," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 271-291, February.
    3. Shao, Zehui & Wu, Pu & Gao, Yingying & Gutman, Ivan & Zhang, Xiujun, 2017. "On the maximum ABC index of graphs without pendent vertices," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 298-312.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Frank Werner, 2020. "Graph-Theoretic Problems and Their New Applications," Mathematics, MDPI, vol. 8(3), pages 1-4, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lkhagva Buyantogtokh & Batmend Horoldagva & Kinkar Chandra Das, 2020. "On reduced second Zagreb index," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 776-791, April.
    2. Muhammad Imran & Muhammad Kamran Siddiqui & Amna A. E. Abunamous & Dana Adi & Saida Hafsa Rafique & Abdul Qudair Baig, 2018. "Eccentricity Based Topological Indices of an Oxide Network," Mathematics, MDPI, vol. 6(7), pages 1-13, July.
    3. Ayu Ameliatul Shahilah Ahmad Jamri & Fateme Movahedi & Roslan Hasni & Rudrusamy Gobithaasan & Mohammad Hadi Akhbari, 2022. "Minimum Randić Index of Trees with Fixed Total Domination Number," Mathematics, MDPI, vol. 10(20), pages 1-13, October.
    4. Tomáš Vetrík & Selvaraj Balachandran, 2020. "General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 953-973, November.
    5. Fang Gao & Xiaoxin Li & Kai Zhou & Jia-Bao Liu, 2018. "The Extremal Graphs of Some Topological Indices with Given Vertex k -Partiteness," Mathematics, MDPI, vol. 6(11), pages 1-11, November.
    6. Lin, Wenshui & Chen, Jianfeng & Wu, Zhixi & Dimitrov, Darko & Huang, Linshan, 2018. "Computer search for large trees with minimal ABC index," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 221-230.
    7. Das, Kinkar Chandra & Rodríguez, José M. & Sigarreta, José M., 2020. "On the maximal general ABC index of graphs with given maximum degree," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    8. Paul Bosch & Edil D. Molina & José M. Rodríguez & José M. Sigarreta, 2021. "Inequalities on the Generalized ABC Index," Mathematics, MDPI, vol. 9(10), pages 1-17, May.
    9. Shaohui Wang & Chunxiang Wang & Lin Chen & Jia-Bao Liu & Zehui Shao, 2018. "Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges," Mathematics, MDPI, vol. 6(11), pages 1-10, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:7:y:2019:i:4:p:324-:d:218874. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.