The theory of general topology view for continuous mappings is general version and is applied for topological graph theory. Separation axioms can be regard as tools for distinguishing objects in information systems. Rough theory is one of map the topology to uncertainty. The aim of this work is to presented graph, continuity, separation properties and rough set to put a new approaches for uncertainty. For the introduce of various levels of approximations, we introduce several levels of continuity and separation axioms on graphs in Gm-closure approximation spaces.

Abstract. One of the fibrewise micro-topological space is one in which the topology is decided through a group of fibre bundles, in comparison to the usual case in normal, fibrewise topological space. The micro-topological spaces draw power from their ability to be used in descriptions of a wide range of mathematical objects. These can be used to describe the topology of a manifold or even the topology of a group. Apart from easy manipulation, the fibrewise micro-topological spaces yield various mathematical applications, but the one being mentioned here is the possibility for geometric investigation of space or group structure. In this essay, we shall explain what fibrewise micro-topological spaces are, indicate why they are useful in math

In this research, the focus was placed on estimating the parameters of the Hypoexponential distribution function using the maximum likelihood method and genetic algorithm. More than one standard, including MSE, has been adopted for comparison by Using the simulation method

In this paper, some estimators for the reliability function R(t) of Basic Gompertz (BG) distribution have been obtained, such as Maximum likelihood estimator, and Bayesian estimators under General Entropy loss function by assuming non-informative prior by using Jefferys prior and informative prior represented by Gamma and inverted Levy priors. Monte-Carlo simulation is conducted to compare the performance of all estimates of the R(t), based on integrated mean squared.

In this research, the focus was on estimating the parameters on (min- Gumbel distribution), using the maximum likelihood method and the Bayes method. The genetic algorithmmethod was employed in estimating the parameters of the maximum likelihood method as well as  the Bayes method. The comparison was made using the mean error squares (MSE), where the best  estimator  is the one who has the least mean squared error. It was noted that the best estimator was (BLG_GE).

In this paper, The transfer function model in the time series was estimated using different methods, including parametric Represented by the method of the Conditional Likelihood Function, as well as the use of abilities nonparametric are in two methods  local linear regression and cubic smoothing spline method, This research aims to compare those capabilities with the nonlinear transfer function model by using the style of simulation and the study of two models as output variable and one model as input variable in addition t

In this paper, we define a cubic positive implicative-ideal, a cubic implicative-ideal and a cubic commutative-ideal of a semigroup in KU-algebra as a generalization of a fuzzy (positive implicative-ideal, an implicative-ideal and a commutative-ideal) of a semigroup in KU-algebra. Some relations between these types of cubic ideals are discussed. Also, some important properties of these ideals are studied. Finally, some important theories are discussed. It is proved that every cubic commutative-ideal, cubic positive implicative-ideal, and cubic implicative-ideal are a cubic ideal, but not conversely. Also, we show that if Θ is a cubic positive implicative-ideal and a cubic commutative-ideal then Θ is a cubic implicative-ideal. Some exam

In this paper the research introduces a new definition of a fuzzy normed space then the related concepts such as fuzzy continuous, convergence of sequence of fuzzy points and Cauchy sequence of fuzzy points are discussed in details.

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.