Search arXivSearch

arXiv · 2508.04518

Bounds of Trees with Degree Sequence-Based Topological Indices on Specialized Graph Classes

Abstract

In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} °_G(u) \sqrt{\ln °_G(u)}$ and the variable sum exdeg index $SEI_a(G)$ for $a>0$, $a\neq 1$. We present several sharp bounds and characterizations of these and related topological indices on specialized graph classes, including regular graphs, thorny graphs, and chemical trees. Using the strict convexity of function $f$, inequalities for degree-based graph invariants $H_f(T)$ are derived under structural constraints on trees such as branching vertices and maximum degree. Examples on caterpillar trees illustrate the computation of indices like $^{m}M_2(G)$, $F(G)$, $M_2(G)$, and others, revealing the interplay between degree sequences and index values. Additionally, upper and lower bounds on the Sombor index $SO(G^*)$ of thorny graphs $G^*$ are established as \[ \operatorname{SO} \leqslant \sum_{uv\in E(G)}\sqrt{\frac{1}{°_{G}(u)^2+°_{G}(v)^2}+°_{G}(u)+°_{G}(v)}, \] including criteria for equality, with implications for regular and thorn-regular graphs. The treatment includes detailed formulas, constructive examples, and inequalities critical for understanding the relationship between graph topology and vertex-degree-based descriptors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jasem Hamoud, Duaa Abdullah. 2025-08-06. Bounds of Trees with Degree Sequence-Based Topological Indices on Specialized Graph Classes. https://arxiv.org/abs/2508.04518

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO