On k-dprime Divisor Function Graph

Abstract

Let p and q be distinct primes. The semiprime divisor function graph denoted by GD(pq), is the graph with vertex set V(GD(pq))=\1,p,q,pq\ and edge set E(GD(pq))=\\1,p\, \1,q\,\1,pq\,\p,pq\,\q,pq\\. The semiprime divisor function graph is a special type of divisor function graph GD(n) in which n=pq. Recently, the energy and some indices of semiprime divisor function graph have been determined. In this paper, we introduce a natural extension to the semiprime divisor function graph which we call the k-dprime divisor function graph. Moreover, we present results on some distance-based and degree-based topological indices of k-dprime divisor function graph. We end the paper by giving some open problems.

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…