We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/On the Sombor index of graphs
PeriodicalsMathematics

On the Sombor index of graphs

Checking your access to this record.

Abstract & Overview

This paper is concerned with a recently introduced graph invariant, namely the Sombor index.Some bounds on the Sombor index are derived, and then utilized to establish additional bounds by making use of the existing results.One of the direct consequences of one of the obtained bounds is that the cycle graph Cn attains the minimum Sombor index among all connected unicyclic graphs of a fixed order n ≥ 4. Graphs having the maximum Sombor index are also characterized from the classes of all connected unicyclic, bicyclic, tricyclic, tetracyclic, and pentacyclic graphs of a fixed order, and a conjecture concerning the maximum Sombor index of graphs of higher cyclicity is stated.A structural result is derived for graphs with integer values of Sombor index.Several possible directions for future work are also indicated.

Cite this record

Tamás Réti, Tomislav Došlić (2021). On the Sombor index of graphs. Contributions to Mathematics, 11–18. https://doi.org/10.47443/cm.2021.0006

Copy in another style

Réti, T., & Došlić, T. (2021). On the Sombor index of graphs. Contributions to Mathematics, 11–18. https://doi.org/10.47443/cm.2021.0006
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.