相关论文: The Structures of Zero-divisor Semigroups with Gra…

Let $(A, \oplus, *, 0)$ be an MV-algebra, $(A, \odot, 0)$ be the associated commutative semigroup, and $I$ be an ideal of $A$. Define the ideal-based zero-divisor graph $\Gamma_{I}(A)$ of $A$ with respect to $I$ to be a simple graph with…

We describe the structure of 0-simple countably compact topological inverse semigroups and the structure of congruence-free countably compact topological inverse semigroups.

This article studies the zero divisor graphs of the ring of Lipschitz integers modulo $n$. In particular we focus on the number of vertices, the diameter and the girth. We also give some results regarding the domination number of these…

In this paper, we continue our study of the zero-divisor graphs of lower dismantlable lattices that was started in [20]. The present paper mainly deals with an Isomorphism Problem for the zero-divisor graphs of lattices. In fact, we prove…

In this article, we introduce a new graph theoretic structure associated with a finite commutative ring, called nil clean divisor graph. For a ring $R$, nil clean divisor graph is denoted by $G_N(R)$, where the vertex set is $\{x\in R\,:\,…

Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E). Specifically, we describe the…

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. In this paper we derive the Vertex and Edge…

Let $K=\mathbb Q(\sqrt D)$ be a real quadratic field. We consider the additive semigroup $\mathcal O_K^+(+)$ of totally positive integers in $K$ and determine its generators (indecomposable integers) and relations; they can be nicely…

For any graph inverse semigroup $G(E)$ we describe subsemigroups $D^0=D\cup\{0\}$ and $J^0=J\cup\{0\}$ of $G(E)$ where $D$ and $J$ are arbitrary $\mathcal{D}$-class and $\mathcal{J}$-class of $G(E)$, respectively. In particular, we prove…

For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. In this paper, we consider the zero divisor graph…

A non-zero component graph $G(\mathbb{V})$ associated to a finite vector space $\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one…

In this paper, we investigate the Tur\'an exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Tur\'an number of the 1-subdivision of $K_{s,t}^+$, where…

Inspired by a very recent work of A. {\DH}uri\'c, S. Jev{\dj}eni\'c and N. Stopar, we introduce a new definition of zero-divisor graphs attached to rings, that includes all of the classical definitions already known in the literature. We…

A numerical semigroup is a subset of N containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of…

We calculate the Wiener index of the zero-divisor graph of a finite semisimple ring. We also calculate the Wiener complexity of the zero-divisor graph of a finite simple ring and find an upper bound for the Wiener complexity in the…

Let R be a commutative ring with identity, and let I be an ideal of R. The zero-divisor graph of R with respect to I, denoted by $\Gamma_I(R)$, is the graph whose vertices are the set $\{x \in R \setminus I | xy \in I$ for some $y \in R…

Let $X$ be a non-empty set of positive integers and $X^*=X\setminus \{1\}$. The divisibility graph $D(X)$ has $X^*$ as the vertex set and there is an edge connecting $a$ and $b$ with $a, b\in X^*$ whenever $a$ divides $b$ or $b$ divides…

The proper divisor graph $\Upsilon_n$ of a positive integer $n$ is the simple graph whose vertices are the proper divisors of $n$, and in which two distinct vertices $u, v$ are adjacent if and only if $n$ divides $uv$. The graph…

Let $p$ and $q$ be distinct primes. The \textit{semiprime divisor function graph} denoted by $G_{D(pq)}$, is the graph with vertex set $V(G_{D(pq)})=\{1,p,q,pq\}$ and edge set $E(G_{D(pq)})=\{\{1,p\}, \{1,q\},\{1,pq\},\{p,pq\},\{q,pq\}\}$.…