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

The Eccentric-Distance Sum Polynomials of Graphs by Using Graph Products

Author

Listed:
  • Alaa Altassan

    (Department of Mathematics, King Abdulaziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia)

  • Muhammad Imran

    (Department of Mathematical Sciences, United Arab Emirates University, Al Ain 15551, United Arab Emirates)

  • Shehnaz Akhter

    (School of Natural Sciences, National University of Sciences and Technology, Islamabad 44000, Pakistan)

Abstract

The correlations between the physico-chemical properties of a chemical structure and its molecular structure-properties are used in quantitative structure-activity and property relationship studies (QSAR/QSPR) by using graph-theoretical analysis and techniques. It is well known that some structure-activity and quantitative structure-property studies, using eccentric distance sum, are better than the corresponding values obtained by using the Wiener index. In this article, we give precise expressions for the eccentric distance sum polynomial of some graph products such as join, Cartesian, lexicographic, corona and generalized hierarchical products. We implement our outcomes to calculate this polynomial for some significant families of molecular graphs in the form of the above graph products.

Suggested Citation

  • Alaa Altassan & Muhammad Imran & Shehnaz Akhter, 2022. "The Eccentric-Distance Sum Polynomials of Graphs by Using Graph Products," Mathematics, MDPI, vol. 10(16), pages 1-13, August.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:16:p:2834-:d:883981
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/16/2834/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/16/2834/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hamid Darabi & Yaser Alizadeh & Sandi Klavžar & Kinkar Chandra Das, 2021. "On the relation between Wiener index and eccentricity of a graph," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 817-829, May.
    Full references (including those not matched with items on IDEAS)

    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. Hongfang Liu & Jinxia Liang & Yuhu Liu & Kinkar Chandra Das, 2023. "A Combinatorial Approach to Study the Nordhaus–Guddum-Type Results for Steiner Degree Distance," Mathematics, MDPI, vol. 11(3), pages 1-19, February.

    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:10:y:2022:i:16:p:2834-:d:883981. 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.