IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v412y2022ics0096300321006597.html
   My bibliography  Save this article

On Sombor index of trees

Author

Listed:
  • Das, Kinkar Chandra
  • Gutman, Ivan

Abstract

This paper is concerned with the recently introduced Sombor index SO, defined asSO=SO(G)=∑vkvℓ∈E(G)dG(vk)2+dG(vℓ)2,where dG(v) is the degree of the vertex v of a graph G. We present bounds on SO of trees in terms of order, independence number, and number of pendent vertices, and characterize the extremal cases. In addition, analogous results for quasi-trees are established.

Suggested Citation

  • Das, Kinkar Chandra & Gutman, Ivan, 2022. "On Sombor index of trees," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    • Handle: RePEc:eee:apmaco:v:412:y:2022:i:c:s0096300321006597
    DOI: 10.1016/j.amc.2021.126575
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321006597
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126575?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cruz, Roberto & Gutman, Ivan & Rada, Juan, 2021. "Sombor index of chemical graphs," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    2. 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.
    3. Kinkar Chandra Das & Yilun Shang, 2021. "Some Extremal Graphs with Respect to Sombor Index," Mathematics, MDPI, vol. 9(11), pages 1-15, 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. Kinkar Chandra Das & Yilun Shang, 2021. "Some Extremal Graphs with Respect to Sombor Index," Mathematics, MDPI, vol. 9(11), pages 1-15, May.
    2. Li, Shuchao & Wang, Zheng & Zhang, Minjie, 2022. "On the extremal Sombor index of trees with a given diameter," Applied Mathematics and Computation, Elsevier, vol. 416(C).
    3. Cruz, Roberto & Rada, Juan & Sigarreta, José M., 2021. "Sombor index of trees with at most three branch vertices," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    4. Sakander Hayat & Farwa Asmat, 2023. "Sharp Bounds on the Generalized Multiplicative First Zagreb Index of Graphs with Application to QSPR Modeling," Mathematics, MDPI, vol. 11(10), pages 1-14, May.
    5. Zhang, Weilin & You, Lihua & Liu, Hechao & Huang, Yufei, 2021. "The expected values and variances for Sombor indices in a general random chain," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    6. Lkhagva Buyantogtokh & Batmend Horoldagva & Kinkar Chandra Das, 2022. "On General Reduced Second Zagreb Index of Graphs," Mathematics, MDPI, vol. 10(19), pages 1-18, September.
    7. Shang, Yilun, 2022. "Sombor index and degree-related properties of simplicial networks," Applied Mathematics and Computation, Elsevier, vol. 419(C).
    8. Sun, Xiaoling & Du, Jianwei, 2022. "On Sombor index of trees with fixed domination number," Applied Mathematics and Computation, Elsevier, vol. 421(C).
    9. Chen, Meng & Zhu, Yan, 2024. "Extremal unicyclic graphs of Sombor index," Applied Mathematics and Computation, Elsevier, vol. 463(C).

    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:eee:apmaco:v:412:y:2022:i:c:s0096300321006597. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.