The commuting graph of a finite group G is a graph whose vertex set is the set of non-central elements of G and two distinct vertices are adjacent if they commute. In this article, we compute genus of commuting graphs of ...

Let $\mathscr{B}$ be a commutative ring with $1\neq 0$, $1\leq m

A dominating set $S$ of $G$ is an \textit{equitable dominating set} of $G$ if for every $v \in V(G) \setminus S$, there exists $u \in S$ such that $uv \in V(G)$ and $\displaystyle{\left|\deg(u) - \deg(v)\right| \leq 1.}$ ...

This article embodies a ring theoretic property which, preserves the reversibility of elements at non-zero tripotents. A ring R is defined as quasi tri reversible if any non-zero tripotent element ab of R implies ba is ...

A ring $R$ is called a left $\mathcal{Z}$-symmetric ring if $ab \in \mathcal{Z}_l(R)$ implies $ba \in \mathcal{Z}_l(R)$, where $\mathcal{Z}_l(R)$ is the set of left zero-divisors. A right $\mathcal{Z}$-symmetric ring is ...

In this research paper, we introduce and analyze the notion of fuzzy neutrosophic prime ideals (FNPIs) in a commutative BCK-algebra $\mathcal{K}$. It represents a further extension of prime ideals in the context of fuzzy ...

Let $G = (V, E)$ be a simple graph of order $n$. A total dominating set of $G$ is a subset $D$ of $V$ such that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to the ...

We introduce the concept of a weak idempotent nil-clean ring as a generalization of a weakly nil-clean ring. We give certain characterizations for weak idempotent nil-clean rings in terms of Jacobson radical and nil radical. ...

An ideal $I$ of a ring $R$ is called a right strongly Baer ideal if $r(I)=r(e)$, where $e$ is an idempotent, and there are right semicentral idempotents $e_{i}$ ($1\leq i\leq n$) with $ReR=Re_{1}R\cap Re_{2}R\cap...\cap ...

The notion of w−filters is introduced in an Almost Distributive Lattice(ADL) and properties are investigated. A necessary and sufficient condition is derived for a maximal filter of an ADL to become a w−filter which leads ...

The notion of hemicomplemented lattices is introduced and some of the properties of these algebras are studied. Some characterization theorems of hemicomplemented lattices are derived with the help of minimal prime D-filters, ...

‎Let $G=(V‎, ‎E)$ be a simple graph‎. ‎A set $C$ of vertices of $G$ is an identifying code of $G$ if for every two vertices $x$ and $y$ the sets $N_{G}[x] \cap C$ and $N_{G}[y] \cap C$ are non-empty and different‎. ‎Given ...