Searcharxiv⌕ Search

arXiv subjects

David Dolžan

Publications and source records attributed to David Dolžan.

22 records · Page 2Linked to original sources

The total graphs of finite rings

In this paper we extend the study of total graphs $τ(R)$ to non-commutative finite rings $R$. We prove that $τ(R)$ is connected if and only if $R$ is not local and we see that in that case $τ(R)$ is always Hamiltonian. We also find an upper bound for the domination number of $τ(R)$ for all finite rings $R$.

math.RA↗

The zero-divisor graphs of semirings

In this paper we study zero--divisor graphs of rings and semirings. We show that all zero--divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic zero-divisor graphs of semirings and prove that in the case zero-divisor graphs are cyclic, their girths are less than or equal to 4. We find all possible cyclic zero-divisor graphs over commutative semirings having at most one 3-cycle, and characterize all complete $k$-partite and regular zero-divisor graphs. Moreover, we characterize all additively cancellative commutative semirings and all commutative rings such that their zero--divisor graph has exactly one 3-cycle.

math.RA↗

Diameters of commuting graphs of matrices over semirings

We calculate the diameters of commuting graphs of matrices over the binary Boolean semiring, the tropical semiring and an arbitrary nonentire commutative semiring. We also find the lower bound for the diameter of the commuting graph of the semiring of matrices over an arbitrary commutative entire antinegative semiring.

math.RA↗

Invertible and nilpotent matrices over antirings

In this paper we characterize invertible matrices over an arbitrary commutative antiring S and find the structure of GL_n (S). We find the number of nilpotent matrices over an entire commutative finite antiring. We prove that every nilpotent $n \times n$ matrix over an entire antiring can be written as a sum of $\lceil \log_2 n \rceil$ square-zero matrices and also find the necessary number of square-zero summands for an arbitrary trace-zero matrix to be expressible as their sum.

math.AC↗