Topological Indices of Divisor Prime Graphs

Abstract

Graph theory provides powerful tools for modeling concepts in number theory, leading to the introduction of graphs derived from arithmetic properties. One such structure is the divisor prime graph, GDp(n). For any positive integer n, let D(n) be the set of its positive divisors. The vertex set of GDp(n) consists of the elements of D(n), with the adjacency condition that two vertices x and y share an edge if and only if their greatest common divisor is 1. The primary focus of this study is to evaluate the topological characteristics of GDp(n). To achieve this, we analyze and compute various distance and degree-based indices, specifically focusing on the Wiener, Harary, hyper-Wiener, First and Second Zagreb, Schultz, Gutman, and Eccentric connectivity indices.

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…