A STUDY ON THE REVERSE EULER SOMBOR INDEX OF VARIOUS GRAPHS
In this paper an attempt to define vertex degree-based topological index, reverse Euler Sombor index is made and its mathematical properties are established. Reverse Euler Sombor index \\$REU(G)=\sum_{uv\in E(G)}\sqrt{\left(\Delta-d_u+1\right)^2+\left(\Delta-d_v+1\right)^2+\left(\Delta-d_u+1\right)\left(\Delta-d_v+1\right)},$ \\ where $d_u$ is the degree of the vertex $u \in V(G)$ and $\Delta$ is the maximum vertex degree of the graph $G$. $REU$ index is computed for standard graphs like path, cycle, complete, crown, star, wheel, friendship, ladder, butterfly, complete bipartite, helm and regular. The bounds of reverse Euler Sombor index are found using famous Cauchy-Schwarz inequality and Jensen inequality. This study is extended for computing reverse Euler Sombor index for the family of thorn graphs.
Authors
- A. Usha
- M. C. Shanmukha (ORCID: https://orcid.org/0000-0002-9560-1209)
- B. Kirana
Publication Details
- Journal
- South East Asian J of Mathematics and Mathematical Sciences
- Published
- 2024-08-30
- DOI
- https://doi.org/10.56827/seajmms.2024.2002.4
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00