For a commutative ring R, we can form the zero-divisor graph Γ(R) or the ideal-divisor graph ΓI(R) with respect to an ideal I of R. We consider the diameters of direct products of zero-divisor and ideal-divisor graphs.

The detour pebbling number of a graph \(G\) is the least positive integer \(f^{*}(G)\) such that these pebbles are placed on vertices \(G\), we can move pebble to target vertex by sequence moves each taking two off and placing one an adjacent using path. In this paper, compute for commutative ring zero-divisor graphs, sum product zero divisor graphs.

A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if either ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 if ( ) ( ) f u f v , then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial ...

The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95–105.]. In this paper, we will consider this graph for the set of character degrees of a finite group G and obtain some properties of this graph. We show that if G is a solvable group, then the number...

The zero-divisor graph Π(R) of a commutative ring R is the whose vertices are elements such that u and v adjacent if only uv = 0. If graphs G H have same chromatic polynomial, then we say they chromatically equivalent (or χ−equivalent), written as ∼ H. Suppose uniquely determined by its polynomial. Then it said to be unique χ-unique). In this paper, discuss question: For which numbers n Π(Zn) χ...

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors of n in such a way that they have vertex set Zn and edge set {{a, b} : a, b ∈ Zn, gcd(a− b, n) ∈ D}. Using tools from convex optimization, we study the maxim...

In this paper, we study some operations which produce new divisor graphs from old ones. We prove that the contraction of a divisor graph along a bridge is a divisor graph. For two transmitters (receivers) u and v in some divisor orientation of a divisor graph G, it is shown that the merger G |u,v is also a divisor graph. Two special types of vertex splitting are introduced, one of which produce...