English

Topological Indices With Degree Sequence $\mathscr{D}$ of Tree

Combinatorics 2025-12-16 v3

Abstract

In this paper, we refer to a asymptotic degree sequence as D=(d1,d2,,dn)\mathscr{D}=(d_1,d_2,\dots,d_n). The examination of topological indices on trees gives us a general overview through bounds to find the maximum and minimum bounds which reflect the maximum and minimum number of edges incident to every vertex in the graph, Albertson index known as uvE(G)du(G)dv(G)\sum_{uv\in E(G)}\lvert d_u(G)-d_v(G) \rvert, Sigma index σ(G)\sigma(G) among D\mathscr{D} of tree TT when dnd1d_n\geqslant \dots \geqslant d_1. According to the first zegrb we show for a degree sequence of order n=4n=4, irr(T)=M1(T)22M1(T)+i=14xixi+1(b+c)1\operatorname{irr}(T)=M_1(T)^2-2\sqrt{M_1(T)}+\sum_{i=1}^4\left|x_i-x_{i+1}\right|-(b+c)-1.

Keywords

Cite

@article{arxiv.2503.12909,
  title  = {Topological Indices With Degree Sequence $\mathscr{D}$ of Tree},
  author = {Jasem Hamoud and Duaa Abdullah},
  journal= {arXiv preprint arXiv:2503.12909},
  year   = {2025}
}
R2 v1 2026-06-28T22:23:12.643Z