Bounds for First and Second Gourava Indices

The study of chemical graph theory frequently utilizes degree-based topological indices because of their close relationships to molecular characteristics. The first Gourava index and the second Gourava index are the two well-known degree-dependent indices for which we employ an integral-based bounding method in this paper. The first and second Gourava index of any graph $G$ is defined by $\mathbf{GO}_1(G)=\sum_{uv\in E(G)}\big(d(u)+d(v)+d(u)d(v)\big)$ and $\mathbf{GO}_2(G)=\sum_{uv\in E(G)}\big(d(u)+d(v))(d(u)d(v)\big)$, respectively. We obtain new upper and lower bounds that are explicitly stated in terms of fundamental graph parameters like the number of edges, the number of pendant vertices, the maximum degree, and the minimum non-pendant degree by substituting integrals over unit intervals for discrete degree contributions.

Authors

Institutions

Publication Details

Journal
Mathematical Sciences and Applications E-Notes
Published
2026-05-21
DOI
https://doi.org/10.36753/mathenot.1869518
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bounds for First and Second Gourava Indices

Havva Kırgız, Ayşe Dilek Maden
Mathematical Sciences and Applications E-Notes
Graph theory and applications
article

Bounds for First and Second Gourava Indices

Havva Kırgız, Ayşe Dilek Maden
article en

Abstract

The study of chemical graph theory frequently utilizes degree-based topological indices because of their close relationships to molecular characteristics. The first Gourava index and the second Gourava index are the two well-known degree-dependent indices for which we employ an integral-based bounding method in this paper. The first and second Gourava index of any graph $G$ is defined by $\mathbf{GO}_1(G)=\sum_{uv\in E(G)}\big(d(u)+d(v)+d(u)d(v)\big)$ and $\mathbf{GO}_2(G)=\sum_{uv\in E(G)}\big(d(u)+d(v))(d(u)d(v)\big)$, respectively. We obtain new upper and lower bounds that are explicitly stated in terms of fundamental graph parameters like the number of edges, the number of pendant vertices, the maximum degree, and the minimum non-pendant degree by substituting integrals over unit intervals for discrete degree contributions.

Mathematical Sciences and Applications E-Notes(Advanced Online Publication)
Selçuk University (TR), Necmettin Erbakan University (TR)
Openalex Percentile: Top 3%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.