Topological Indices With Degree Sequence D of Tree

Abstract

In this paper, we refer to a asymptotic degree sequence as D=(d1,d2,…,dn). 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 Σuv∈ E(G) du(G)-dv(G) , Sigma index σ(G) among D of tree T when dn≥slant … ≥slant d1. According to the first zegrb we show for a degree sequence of order n=4, irr(T)=M1(T)2-2M1(T)+Σi=14|xi-xi+1|-(b+c)-1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…