ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

POWER CHAINS IN A DIVISOR GRAPH

Journal: IMPACT : International Journal of Research in Humanities, Arts and Literature (IMPACT : IJRHAL) (Vol.7, No. 4)

Publication Date:

Authors : ; ;

Page : 383-390

Keywords : Associative Ring; Divisor Graph of a Ring; Complete Graph;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

The divisor graph of an associative ring R (denoted as DG(R)) was introduced by Satyanarayana, Srinivasulu.[9]. In this paper, we introduce a simple concept “Power Chain in a Divisor Graph” .We prove that if is nilpotent, then the power chain starting with a is of finite length. If DG(R) (the divisor graph of R) contains a power chain starting with which is of infinite length, then , a is non–idempotent and non–nilpotent element. We announce some basic results. Finally, we deduce that if R be an integral domain and a , then if and only if the power chain starting with a (in DG(R)) is of infinite length.

Last modified: 2019-05-23 14:44:07