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

            This paper is interested in certain  subclasses of univalent and bi-univalent functions concerning  to shell- like curves connected with k-Fibonacci numbers involving modified Sigmoid activation function θ(t)=2/(1+e^(-t) ) ,t ≥0 in unit disk |z|<1 . For estimating of the initial coefficients |c_2 | , |c_3 |, Fekete-Szego ̈ inequality and the  second Hankel determinant have been investigated for the functions in our classes. 

The theory of Topological Space Fiber is a new and essential branch of mathematics, less than three decades old, which is created in forced topologies. It was a very useful tool and played a central role in the theory of symmetry. Furthermore, interdependence is one of the main things considered in topology fiber theory. In this regard, we present the concept of topological spaces α associated with them and study the most important results.

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

The radial wave function R(r) and the radial distribution function P(r) as a function of (r), for the Hydrogen atom was calculated for several atomic state (1s,2s,2p,3s,3p,3d) The results were compared with Hydrogen like atom(He+,Li+2,Be+3).

We introduce and discuss recent type of fibrewise topological spaces, namely fibrewise soft bitopological spaces. Also, we introduce the concepts of fibrewise closed soft bitopological spaces, fibrewise open soft bitopological spaces, fibrewise locally sliceable soft bitopological spaces and fibrewise locally sectionable soft bitopological spaces. Furthermore, we state and prove several propositions concerning these concepts.

Astronomers have known since the invention of the telescope that atmospheric turbulence affects celestial images. So, in order to compensate for the atmospheric aberrations of the observed wavefront, an Adaptive Optics (AO) system has been introduced. The AO can be arranged into two systems: closedloop and open-loop systems. The aim of this paper is to model and compare the performance of both AO loop systems by using one of the most recent Adaptive Optics simulation tools, the Objected-Oriented Matlab Adaptive Optics (OOMAO). Then assess the performance of closed and open loop systems by their capabilities to compensate for wavefront aberrations and improve image quality, also their effect by the observed optical bands (near-infrared band

In this paper, third order non-polynomial spline function is used to solve 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of this method, and to compare the computed results with other known methods.

This work, deals with Kumaraswamy distribution. Kumaraswamy (1976, 1978) showed well known probability distribution functions such as the normal, beta and log-normal but in (1980) Kumaraswamy developed a more general probability density function for double bounded random processes, which is known as Kumaraswamy’s distribution. Classical maximum likelihood and Bayes methods estimator are used to estimate the unknown shape parameter (b). Reliability function are obtained using symmetric loss functions by using three types of informative priors two single priors and one double prior. In addition, a comparison is made for the performance of these estimators with respect to the numerical solution which are found using expansion method. The

This paper is concerned with the numerical solutions of the vorticity transport equation (VTE) in two-dimensional space with homogenous Dirichlet boundary conditions. Namely, for this problem, the Crank-Nicolson finite difference equation is derived.  In addition, the consistency and stability of the Crank-Nicolson method are studied. Moreover, a numerical experiment is considered to study the convergence of the Crank-Nicolson scheme and to visualize the discrete graphs for the vorticity and stream functions. The analytical result shows that the proposed scheme is consistent, whereas the numerical results show that the solutions are stable with small space-steps and at any time levels.