Table of Contents
Fetching ...

Bounds on Elliptic Sombor and Euler Sombor indices of join and corona product of graphs

Bishal Sonar, Ravi Srivastava

TL;DR

Analyzes sharp, parameterized bounds for the Elliptic Sombor index ($ESO$) and the Euler Sombor index ($EU$) under the join $G_1+G_2$ and the corona product $G_1∘G_2$. It expresses the bounds in terms of the graphs' sizes and orders ($n_1,n_2,m_1,m_2$) and degree ranges ($ abla_{G_i}, abla_{G_i}$), and proves tightness when the input graphs are regular. For regular graphs with degrees $r_1$ and $r_2$, the authors provide closed-form expressions for ESO and EU under both join and corona operations. These results deepen the understanding of degree-based topological indices under standard graph products and may improve predictive modeling in chemical graph theory.

Abstract

The Elliptic Somber and Euler Somber indices are newly defined topological indices based on the Somber index. Our paper presents calculations of the upper and lower bounds of these indices for the join and corona product of arbitrary graphs. Furthermore, we demonstrate that these bounds are attained when both graphs are regular.

Bounds on Elliptic Sombor and Euler Sombor indices of join and corona product of graphs

TL;DR

Analyzes sharp, parameterized bounds for the Elliptic Sombor index () and the Euler Sombor index () under the join and the corona product . It expresses the bounds in terms of the graphs' sizes and orders () and degree ranges (), and proves tightness when the input graphs are regular. For regular graphs with degrees and , the authors provide closed-form expressions for ESO and EU under both join and corona operations. These results deepen the understanding of degree-based topological indices under standard graph products and may improve predictive modeling in chemical graph theory.

Abstract

The Elliptic Somber and Euler Somber indices are newly defined topological indices based on the Somber index. Our paper presents calculations of the upper and lower bounds of these indices for the join and corona product of arbitrary graphs. Furthermore, we demonstrate that these bounds are attained when both graphs are regular.

Paper Structure

This paper contains 3 sections, 8 theorems, 7 equations.

Key Result

Theorem 3.1

Let $G_1$ and $G_2$ be two graphs of order $n_1$ and $n_2$ and size $m_1$ and $m_2$ respectively. Then $\alpha_1 \leq ESO(G_1+G_2)\leq \alpha_2$, where $\alpha_1=2\sqrt{2}m_1(\delta_{G_1}+n_2)^2+2\sqrt{2}m_2(\delta_{G_2}+n_1)^2+n_1n_2(\delta_{G_1}+n_2+\delta_{G_2}+n_1)\{(\delta_{G_1}+n_2)^2+(\delta_

Theorems & Definitions (18)

  • Definition 2.1: Join
  • Definition 2.2: Corona Product
  • Theorem 3.1
  • proof
  • Proposition 3.2
  • proof
  • Theorem 3.3
  • proof
  • Proposition 3.4
  • proof
  • ...and 8 more