EXTREMAL VALUES ON THE MODIFIED SOMBOR INDEX OF TREES AND UNICYCLIC GRAPHS
Let \(G=(V,E)\) be a simple connected graph. The modified Sombor index denoted by \(mSo(G)\) is defined as $$mSo(G)=\sum_{uv\in E}\frac{1}{\sqrt{d^2_u+d^2_v}},$$ where \(d_v\) denotes the degree of vertex \(v\). In this paper we present extremal values of modified Sombor index over the set of trees...
Saved in:
Main Authors: | Raghavendra H Kashyap, Yanamandram B Venkatakrishnan, Rashad Ismail, Selvaraj Balachandran, Hari Naresh Kumar |
---|---|
Format: | Article |
Language: | English |
Published: |
Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics
2024-07-01
|
Series: | Ural Mathematical Journal |
Subjects: | |
Online Access: | https://umjuran.ru/index.php/umj/article/view/618 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An elliptic-eccentric sombor index of graphs and its chemical applicabilities
by: B Chaluvaraju, et al.
Published: (2024-12-01) -
Some inequalities of reformulated and entire Inf-Sombor index
by: Jalappa ., et al.
Published: (2025-06-01) -
Total Global Dominator Coloring of Trees and Unicyclic Graphs
by: Chithra K. P., et al.
Published: (2023-08-01) -
Dividing Graceful Labeling of Certain Tree Graphs
by: Abdullah Zahraa O, et al.
Published: (2020-08-01) -
DOMINATION AND EDGE DOMINATION IN TREES
by: B. Senthilkumar, et al.
Published: (2020-07-01)