On the dot product graph of a commutative ring II
View/
Open
Date
2020Author
Abdulla, Mohammad Ahmad
Badawi, Ayman
Advisor(s)
Unknown advisorType
Peer-Reviewed
Article
Published version
Metadata
Show full item recordAbstract
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 T D(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 T D(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 T D(R) with vertices U(R). In this paper, we study the structure of T D(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.DSpace URI
http://hdl.handle.net/11073/18297External URI
https://doi.org/10.24330/ieja.7681351306-6048Collections
Related items
Showing items related by title, author, creator and subject.
-
Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
Badawi, Ayman; Rissner, Roswitha (De Gruyter, 2020)For a partially ordered set(A, ≤), letGA be the simple, undirected graph with vertex set A such that two vertices a ≠ ∈ b A are adjacent if either a ≤ b or b a ≤ . We call GA the partial order graph or comparability graph ... -
On The Unit Dot Product Graph Of A Commutative Ring.
Abdulla, Mohammad Ahmad (2016-01)In 2015, Ayman Badawi (Badawi, 2015) introduced the dot product graph associated to a commutative ring A. Let A be a commutative ring with nonzero identity, 1 n < 1 be an integer, and R =A x A x ... x A (n times). We ... -
The n-zero-divisor graph of a commutative semigroup
Anderson, David F.; Badawi, Ayman (Taylor and Francis, 2022-04-16)Let S be a (multiplicative) commutative semigroup with 0, Z(S) the set of zero-divisors of S, and n a positive integer. The zero-divisor graph of S is the (simple) graph Γ(S) with vertices Z(S) ∗ = Z(S) \ {0}, and distinct ...