Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

The k-Sombor Index of Trees

    https://doi.org/10.1142/S0217595923500021Cited by:1 (Source: Crossref)

    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)=uvE(G)kd(u)k+d(v)k,
    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 k1 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 k1. To demonstrate this, we also characterize the extremal trees with respect to the SO12 with matching number, the number of pendant vertices and diameter. In addition, three relevant conjectures are proposed.