NON-NILPOTENT GRAPH OF COMMUTATIVE RINGS

Let R be a commutative ring with unity. Let Nil(R) be the set of all nilpotent elements of R and Nil(R) = R \ Nil(R) be the set of all non-nilpotent elements of R. The non-nilpotent graph of R is a simple undirected graph GNN(R) with Nil(R) as vertex set and any two distinct vertices x and y are adjacent if and only if x+y ∈ Nil(R).In this paper, we introduce and discuss the basic properties of the graph GNN(R). We also study the diameter and girth of GNN(R). Further, we determine the domination number and the bondage number of GNN(R). We establish a relation between diameter and domination number of GNN(R). We also establish a relation between girth and bondage number of GNN(R).

Keywords:

Commutative rings , Non-nilpotent graph , Nilpotent elements , Non-nilpotent elements