A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

The Chinese postman problem was first proposed by the Chinese mathematician Meigu
Guan. It says that a postman picks up mails at the post office, delivers it along a set of streets …

Abstract Number theoretic graphs are one of the emerging fields in Graph theory. This article
is a study on existing research results on Number theoretic graphs, especially on Divisor …

We present characterizations of connected graphs G of order n≥ 2 for which h+ (G)= n. It is
shown that for every two integers n and m with 11≤ n−≤ m≤(n 2), there exists a connected …

Starting from 1980, the concepts of Number Theory were used in Graph theory and several
types of graphs have been introduced. In this sequel we have introduced divisor function …

The power graph is a special type undirected simple graph of a finite group G which has the
group elements as its vertex set and two distinct vertices x, y∈ G are adjacent if one is non …

The divisor graph, denoted by D (Z p [x, n]), is the graph whose vertex set is the set of all
polynomials of degree at most n whose coefficients are from field Z p and its any two distinct …

We denote by D (Zp [x, 2]), the divisor graph of set of all polynomials of degree at most two
whose coefficients are from field Zp as its vertex set and any two distinct vertices in it are …

Let $ p $ and $ q $ be distinct primes. The\textit {semiprime divisor function graph} denoted
by $ G_ {D (pq)} $, is the graph with vertex set $ V (G_ {D (pq)})=\{1, p, q, pq\} $ and edge set …

Let $ R $ be a finite commutative principal ideal ring with unity. In this article, we prove that
the zero-divisor graph $\Gamma (R) $ is a divisor graph if and only if $ R $ is a local ring or it …