English

On $k$-dprime Divisor Function Graph

Combinatorics 2021-11-23 v2

Abstract

Let pp and qq be distinct primes. The \textit{semiprime divisor function graph} denoted by GD(pq)G_{D(pq)}, is the graph with vertex set V(GD(pq))={1,p,q,pq}V(G_{D(pq)})=\{1,p,q,pq\} and edge set E(GD(pq))={{1,p},{1,q},{1,pq},{p,pq},{q,pq}}E(G_{D(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)G_{D(n)} in which n=pqn=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 \textit{kk-dprime divisor function graph}. Moreover, we present results on some distance-based and degree-based topological indices of kk-dprime divisor function graph. We end the paper by giving some open problems.

Keywords

Cite

@article{arxiv.2111.02183,
  title  = {On $k$-dprime Divisor Function Graph},
  author = {John Rafael M. Antalan and Jerwin G. De Leon and Regine P. Dominguez},
  journal= {arXiv preprint arXiv:2111.02183},
  year   = {2021}
}

Comments

19 pages, 3 figures, submitted for conference presentation

R2 v1 2026-06-24T07:24:18.886Z