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

Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…

The structure of categorical at zero semigroups is studied from the point of view their likeness to categories.

Here we study some algebraic properties of non-cyclic graphs. In this paper we show that $\overline{\Gamma}_G$ is isomorphic to $K_3\cup (n-4)K_1$ or $K_4\cup (n-5)K_1$ if and only if $G$ is isomorphic to $D_8$ or $D_{10}$, respectively. We…

A divisor graph $G$ is an ordered pair $(V, E)$ where $V \subset \mathbbm{Z}$ and for all $u \neq v \in V$, $u v \in E$ if and only if $u \mid v$ or $v \mid u$. A graph which is isomorphic to a divisor graph is also called a divisor graph.…

The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor…

We address the following problem: Given a complete $k$-partite geometric graph $K$ whose vertex set is a set of $n$ points in $\mathbb{R}^d$, compute a spanner of $K$ that has a ``small'' stretch factor and ``few'' edges. We present two…

The existence of $1$-factorizations of an infinite complete equipartite graph $K_m[n]$ (with $m$ parts of size $n$) admitting a vertex-regular automorphism group $G$ is known only when $n=1$ and $m$ is countable (that is, for countable…

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

Let $S$ be a semigroup with $0$ and $R$ be a ring with $1$. We extend the definition of the zero-divisor graphs of commutative semigroups to not necessarily commutative semigroups. We define an annihilating-ideal graph of a ring as a…

A {\em fork} is a graph obtained from $K_{1,3}$ (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket} is a union of $K_1$ and $K_4-e$. A graph is perfectly…

Let $R$ be a commutative ring with unity 1, and $ G(V,E)$ be a simple, connected, nontrivial graph. Let $d(a,c)$ be the distance between the vertices $a$ and $c $ in $G$. An undirected zero divisor graph of a ring $R$ is denoted by…

In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups $D_n$, the generalized quaternion groups $Q_n$, the…

We continue our study of the new extension of zero-divisor graph. We give a complete characterization for the possible diameters of $\widetilde{\Gamma}(R)$ and $\widetilde{\Gamma}(R[x_1,\dots,x_n])$, we investigate the relation between the…

In this paper, we provide a complete description of congruence-semisimple semirings and introduce the pre-ordered abelian Grothendieck groups $K_0(S)$ and $SK_0(S)$ of the isomorphism classes of the finitely generated projective and…

The zero-divisor graph $\Gamma(R)$ of a ring $R$ is a graph with nonzero zero-divisors of $R$ as vertices and distinct vertices $x,y$ are adjacent if $xy=0$ or $yx=0$. We provide an equivalence relation on a ring $R$ and express $\Gamma(R)$…

The aim of this paper is to see how commuting graphs interact with two semigroup constructions: the zero-union and the direct product. For both semigroup constructions, we investigate the diameter, clique number, girth, chromatic number and…

Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\{\chi(1) : \chi\in Irr(G)\}$. Let $\rho(G)$ be the set of all primes which divide some…