Bounds on the Inverse symmetric division deg index and the relation with other topological indices of graphs

Abstract

Let G=(V,E) be a simple graph. The concept of Inverse symmetric division deg index (ISDD) was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature. Ghorbani et al. proposed Inverse symmetric division deg index and is defined as ISDD(G)=Σvivj∈ E(G)\,didjd2i+d2j, where di is the degree of the vertex vi in G. In this paper, we obtain some lower and upper bounds on the inverse symmetric division deg index (ISDD) of graphs in terms of various graph parameters, with identifying extremal graphs. Moreover, we present two relations between the Inverse symmetric division deg index and the various topological indices of graphs. Finally, we give concluding remarks with future work.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…