@article{Article_9,

title = {On K-Dprime Divisor Function Graph},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2021},

issue = {1},

issn = { 2783-5456 },

year = {2021},

url = {http://cccs.sgh.ac.ir/Articles/2021/issue 1/1-9-on_kdprime_divisor_function_graph-1637929327.pdf},

author = {John Rafael M. Antalan and Jerwin G. De Leon and Regine P. Dominguez},

keywords = {k-dprime divisor function graph, semiprime divisor function graph, divisor function graph, topological indices.},

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)) = f1, p, q, pqg and edge set E(GD(pq)) = ff1, pg, f1, qg, f1, pqg, fp, pqg, fq, pqgg. 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.}

};