Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

Producing pseudo-random numbers (PRN) with high performance is one of the important issues that attract many researchers today. This paper suggests pseudo-random number generator models that integrate Hopfield Neural Network (HNN) with fuzzy logic system to improve the randomness of the Hopfield Pseudo-random generator. The fuzzy logic system has been introduced to control the update of HNN parameters. The proposed model is compared with three state-ofthe-art baselines the results analysis using National Institute of Standards and Technology (NIST) statistical test and ENT test shows that the projected model is statistically significant in comparison to the baselines and this demonstrates the competency of neuro-fuzzy based model to produce

This paper introduces some properties of separation axioms called α -feeble regular and α -feeble normal spaces (which are weaker than the usual axioms) by using elements of graph which are the essential parts of our α -topological spaces that we study them. Also, it presents some dependent concepts and studies their properties and some relationships between them.

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

Zusammenfassung: Das Drama " Minna von Barnhelm von Lessing ist ein weltbekannts Drama, das in verschiedene Sprachen übersetzt wurde. Es beschreibt die Schwierigkeiten eines Offiziers, der bestraft wurde. Er verlor seinen Job und auch seine Ehre. Minna ist seine Verlobte, die ihn suchte und auch neben ihm stehen wollte. Trotzdem sie ihm in einem Hotel zufällig begegnete, hatten die beide immer noch Probleme. Am Ende des Dramas könnten sie alle ihrer Probleme lösen und hatten schönes Ende.

Abstract:
Mina von Barnhelm is a German play written by the author ( Lessing ) , it's a well-known comedy play that was translated into many languages including Arabic language .
This play is about a

A new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties

In this paper, we introduce the notions of Complete Pseudo Ideal, K-pseudo Ideal, Complete K-pseudo Ideal in pseudo Q-algebra. Also, we give some theorems and relationships among them are debated.

Abstract In this work we introduce the concept of approximately regular ring as generalizations of regular ring, and the sense of a Z- approximately regular module as generalizations of Z- regular module. We give many result about this concept.

Let R be a commutative ring with identity, and let M be a unitary left R-module. M is called Z-regular if every cyclic submodule (equivalently every finitely generated) is projective and direct summand. And a module M is F-regular if every submodule of M is pure. In this paper we study a class of modules lies between Z-regular and F-regular module, we call these modules regular modules.