IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v41y2024i01ns0217595923500021.html
   My bibliography  Save this article

The k-Sombor Index of Trees

Author

Listed:
  • Fangxia Wang

    (College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P. R.China)

  • Baoyindureng Wu

    (College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P. R.China)

Abstract

For a positive real number k, the k-Sombor index of a graph G, introduced by Réti et al, is defined as SOk(G) =∑uv∈E(G)d(u)k + d(v)kk, where d(u) denotes the degree of the vertex u in G. By the definition, SO2(G) is exactly the Sombor index of G, while SO1(G) is the first Zagreb index of G.In this paper, for k ≥ 1 we present the extremal values of the k-Sombor index of trees with some given parameters, such as matching number, the number of pendant vertices, diameter. This generalizes the relevant results on Sombor index due to Chen, Li and Wang ((2002). Extremal values on the Sombor index of trees, MATCH Communications in Mathematical and in Computer Chemistry, 87, 23–49).Handling SOk(G) appears to be different for k < 1 in contrast to the case when k ≥ 1. To demonstrate this, we also characterize the extremal trees with respect to the SO1 2 with matching number, the number of pendant vertices and diameter. In addition, three relevant conjectures are proposed.

Suggested Citation

  • Fangxia Wang & Baoyindureng Wu, 2024. "The k-Sombor Index of Trees," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(01), pages 1-34, February.
    • Handle: RePEc:wsi:apjorx:v:41:y:2024:i:01:n:s0217595923500021
    DOI: 10.1142/S0217595923500021
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595923500021
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595923500021?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.

    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:wsi:apjorx:v:41:y:2024:i:01:n:s0217595923500021. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.