Related papers: Sub-semigroups determined by the zero-divisor grap…

For any Tychonoff space X we have introduced the zero-set in-tersection graph on {\Gamma}(C+(X)) and studied the graph properties in connection with the algebraic properties of the semiring C+(X). We have shown that for any two realcompact…

In this paper, the concepts of set-valued anti-homomorphism and strong set-valued anti-homomorphism of $\Gamma$-semigroup are introduced. The notions of generalized lower and upper approximation operators, constructed by means of set-valued…

We calculate the metric dimension of the total graph of a direct product of finite commutative antinegative semirings with their sets of zero-divisors closed under addition.

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

Let $G$ be a graph, $\chi(G)$ be the minimal number of colors which can be assigned to the vertices of $G$ in such a way that every two adjacent vertices have different colors and $\omega(G)$ to be the least upper bound of the size of the…

Let $G$ be a group. The intersection subgroup graph of $G$ (introduced by Anderson et al. \cite{anderson}) is the simple graph $\Gamma_{S}(G)$ whose vertices are those non-trivial subgroups say $H$ of $G$ with $H\cap K=\{e\}$ for some…

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example,…

From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…

Using the new extension of the zero-divisor graph $\widetilde{\Gamma}(R)$ introduced in \cite{Groupe}, we give an approach of the diameter of $\Gamma(R)$ and $\Gamma(R[X])$ other than given in \cite{Lucas} thus we give a complete…

The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.

A $d$-dimensional box is the cartesian product $R_i\times\cdots\times R_d$ where each $R_i$ is a closed interval on the real line. The boxicity of a graph, denoted as $box(G)$, is the minimum integer $d\geq 0$ such that $G$ is the…

The concept of $\Gamma$-semigroups was introduced by M. K Sen in 1981. This study aims to investigate several intriguing properties of $\Gamma$-semigroups and to provide the concepts of simple $\Gamma$-semigroups, 0-simple…

The following problem has been known since the 80s. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $\{m_i\}_{i=1}^{t}$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…

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…

In this paper, the definitions of soft {\Gamma}-semirings and soft sub {\Gamma}-semi rings are introduced with the aid of the concept of soft set theory introduced by Molodtsov. In the mean time, some of their properties and structural…

We introduce the notion of semibreak divisors on metric graphs (tropical curves) and prove that every effective divisor class (of degree at most the genus) has a semibreak divisor representative. This appropriately generalizes the notion of…

Given a well-ordered semi-group $\Gamma$ with a minimal system of generators of ordinal type at most $\omega n$ and of rational rank $r$, which satisfies a positivity and increasing condition, we construct a zero-dimensional valuation…

A graph $G$ is said to be $2$-divisible if for all (nonempty) induced subgraphs $H$ of $G$, $V(H)$ can be partitioned into two sets $A,B$ such that $\omega(A) < \omega(H)$ and $\omega(B) < \omega(H)$. A graph $G$ is said to be perfectly…

In this work, we address semi-supervised classification of graph data, where the categories of those unlabeled nodes are inferred from labeled nodes as well as graph structures. Recent works often solve this problem via advanced graph…