Abstract

The Prime Coprime Graph is defined as a graph in which two distinct vertices are adjacent if and only if the greatest common divisor of their orders is 1, indicating that they are coprime. This research focuses on deriving general formulas for the Padmakar-Ivan index and the Szeged index for the coprime prime graph of the modulo integer group with n=p^k, where p is a prime number and k is not less than 2. As a result of this study, explicit formulas for the Padmakar-Ivan and Szeged indices were obtained, along with an analysis of the relationship between these two indices.Keywords: prime coprime graph, Padmakar-Ivan index, Szeged index.

Concepts :

Access to Document

Citations by Year