A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

In this paper introduce some generalizations of some definitions which are, closure converge to a point, closure directed toward a set, almost ω-converges to a set, almost condensation point, a set ωH-closed relative, ω-continuous functions, weakly ω-continuous functions, ω-compact functions, ω-rigid a set, almost ω-closed functions and ω-perfect functions with several results concerning them.

The aim of this paper is to introduce and study the concept of SN-spaces via the notation of simply-open sets as well as to investigate their relationship to other topological spaces and give some of its properties.

Today, the prediction system and survival rate became an important request. A previous paper constructed a scoring system to predict breast cancer mortality at 5 to 10 years by using age, personal history of breast cancer, grade, TNM stage and multicentricity as prognostic factors in Spain population. This paper highlights the improvement of survival prediction by using fuzzy logic, through upgrading the scoring system to make it more accurate and efficient in cases of unknown factors, age groups, and in the way of how to calculate the final score. By using Matlab as a simulator, the result shows a wide variation in the possibility of values for calculating the risk percentage instead of only 16. Additionally, the accuracy will be calculate

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

    In this paper, we introduce the bi-normality set, denoted by , which is an extension of the normality set, denoted by  for any operators  in the Banach algebra . Furthermore, we show some interesting properties and remarkable results. Finally, we prove that it is not invariant via some transpose linear operators.

     In this article, an attempt has been made to introduce the concept of Neutrosophic d-Filter and Neutrosophic Prime d-Filter of d-Algebra by generalizing the notion of Intuitionistic Fuzzy d-Filter of d-Algebra. Besides, we establish different properties of them. Further, we study several relations on this notion from the point of view of Neutrosophic d-Algebra.

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont