Results 121 to 130 of about 1,397,791 (213)

Metric dimension of a zero-divisor graph

open access: yes
V diplomski nalogi preučujemo metrično dimenzijo grafa deliteljev niča kolobarja. Za kolobar $R$ definiramo njegov graf deliteljev niča $Gamma(R)$ kot enostaven neusmerjen graf, katerega vozlišča so delitelji niča, med dvema različnima vozliščema pa je ...
Možina, Tadeja
core  

The zero divisor graph of 2 x 2 matrices over a field

open access: yes, 2016
A zero divisor graph, Γ(R), is formed from a ring R by having each element of Z(R)\{0} to be a vertex in the graph and having two vertices u and v adjacent if the corresponding elements from the ring are nonequal and have product equal to zero.
Ashrafi, Ali Reza, Tadayyonfar, Adel
core  

Exploring the Embedding of the Extended Zero-Divisor Graph of Commutative Rings

open access: yes
Rc represents commutative rings that have unity elements. The collection of all zero-divisor elements in Rc are represented by D(Rc). We denote an extended zero-divisor graph by the notation ℸ′(Rc) of Rc. This graph has a set of vertices in D(Rc)*.
Ali Al Khabyah, Moin A. Ansari
core   +1 more source

On the strong metric dimension of the zero-divisor graph of a lattice [PDF]

open access: yes
In this paper, the generalized blow-up of a Boolean lattice $L\cong \textbf{2}^n$ using finite chains is introduced. Also, we compute the strong metric dimension of the zero-divisor graph of the blow-up of a Boolean lattice.
Joshi, Vinayak, Gadge, Pravin
core   +1 more source

On relative simple Heffter spaces. [PDF]

open access: yesJ Algebr Comb (Dordr)
Johnson L, Mella L, Pasotti A.
europepmc   +1 more source

On the connectedness of the complement of the zero-divisor graph of a poset

open access: yes, 2019
In this paper, connectedness is completely characterized for the complements of the zero-divisor graphs of partially ordered sets. These results are applied to annihilating ideal graphs and intersection graphs of submodules, generalizing some of the work
Joshi, Vinayak   +2 more
core  

Home - About - Disclaimer - Privacy