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, . For any positive integer , let be the set of its positive divisors. The vertex set of consists of the elements of , with the adjacency condition that two vertices and share an edge if and only if their greatest common divisor is . The primary focus of this study is to evaluate the topological characteristics of . 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本