{"title":"ON THE DOT PRODUCT GRAPH OF A COMMUTATIVE RING II","authors":"M. Abdulla, Ayman Badawi","doi":"10.24330/ieja.768135","DOIUrl":null,"url":null,"abstract":"In 2015, the second-named author introduced the dot product graph associated to a commutative ring A. Let A be a commutative ring with nonzero identity, 1 ≤ n < ∞ be an integer, and R = A × A × · · · × A (n times). We recall that the total dot product graph of R is the (undirected) graph TD(R) with vertices R∗ = R \\ {(0, 0, ...,0)}, and two distinct vertices x and y are adjacent if and only if x · y = 0 ∈ A (where x · y denotes the normal dot product of x and y). Let Z(R) denote the set of all zero-divisors of R. Then the zero-divisor dot product graph of R is the induced subgraph ZD(R) of TD(R) with vertices Z(R) = Z(R)\\{(0, 0, ..., 0)}. Let U(R) denote the set of all units of R. Then the unit dot product graph of R is the induced subgraph UD(R) of TD(R) with vertices U(R). In this paper, we study the structure of TD(R), UD(R), and ZD(R) when A = Zn or A = GF (pn), the finite field with pn elements, where n ≥ 2 and p is a prime positive integer. 1991 Mathematics Subject Classification Primary: 13A15; Secondary: 13B99; 05C99","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"150 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24330/ieja.768135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In 2015, the second-named author introduced the dot product graph associated to a commutative ring A. Let A be a commutative ring with nonzero identity, 1 ≤ n < ∞ be an integer, and R = A × A × · · · × A (n times). We recall that the total dot product graph of R is the (undirected) graph TD(R) with vertices R∗ = R \ {(0, 0, ...,0)}, and two distinct vertices x and y are adjacent if and only if x · y = 0 ∈ A (where x · y denotes the normal dot product of x and y). Let Z(R) denote the set of all zero-divisors of R. Then the zero-divisor dot product graph of R is the induced subgraph ZD(R) of TD(R) with vertices Z(R) = Z(R)\{(0, 0, ..., 0)}. Let U(R) denote the set of all units of R. Then the unit dot product graph of R is the induced subgraph UD(R) of TD(R) with vertices U(R). In this paper, we study the structure of TD(R), UD(R), and ZD(R) when A = Zn or A = GF (pn), the finite field with pn elements, where n ≥ 2 and p is a prime positive integer. 1991 Mathematics Subject Classification Primary: 13A15; Secondary: 13B99; 05C99