In this paper, a new class of sets, namely - semi-regular closed sets is introduced and studied for topological spaces. This class properly contains the class of semi--closed sets and is property contained in the class of pre-semi-closed sets. Also, we introduce and study srcontinuity and sr-irresoleteness. We showed that sr-continuity falls strictly in between semi-- continuity and pre-semi-continuity.

  In this work, we construct projectively distinct (k,3)-arcs in the projective plane PG(2,9) by applying a geometrical method. The cubic curves have been been constructed by using the general equation of the cubic.         We found that there are complete (13,3)-arcs, complete (15,3)-arcs and we found that the only (16,3)-arcs lead to maximum completeness

  The purpose of this work is to study the classification and construction of (k,3)-arcs in the projective plane PG(2,7). We found that there are two (5,3)-arcs, four (6,3)-arcs, six (7,3)arcs, six (8,3)-arcs, seven (9,3)-arcs, six (10,3)-arcs and six (11,3)-arcs.         All of these arcs are incomplete.         The number of distinct (12,3)-arcs are six, two of them are complete.         There are four distinct (13,3)-arcs, two of them are complete and one (14,3)-arc which is incomplete.         There exists one complete (15,3)-arc.
 

In this work, the linear properties of Vitamin D₃-5000IU soft gel were investigated by measuring its absorption and fluorescence spectra. It was observed that there was a shift towards longer wavelength within limits (75 nm), with quantitative efficiency equal to (33.58%). The values of absorbance were used to calculate the extinction coefficient, optical refractive index, optical conductivity and optical dielectric constant values.

The non-linear properties of Vitamin D₃-5000IU soft gel was also studied using the Z-Scan technique by using Neodymium-doped Yttrium Garnet (Nd: YAG) continuous laser (CW) emitting in       &n

The aim of this paper is to introduce and study some of the Fibrewise minimal regular,Fibrewise maximal regular, Fibrewise minimal completely regular, Fibrewise maximal completely regular, Fibrewise minimal normal, Fibrewise maximal normal, Fibrewise minimal functionally normal, and Fibrewise maximal functionally normal. This is done by providing some definitions of the concepts and examples related to them, as well as discussing some properties and mentioning some explanatory diagrams for those concepts.

A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.

   In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11),  n = 2,3,…,10,11  by geometric method, with the related blocking sets and projective codes.
 

A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.

  In this work, we construct and classify the projectively distinct (k,3)-arcs in PG(2,9), where k ≥ 5, and prove that the complete (k,3)-arcs do not exist, where 5 ≤ k ≤ 13. We found that the maximum complete (k,3)-arc in PG(2,q) is the (16,3)-arc and the minimum complete (k,3)-arc in PG(2,q) is the (14,3)-arc. Moreover, we found the complete (k,3)-arcs between them.

           This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G^* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set,  μ(u, v) ≤ σ(u) ᴧ σ(v) and  η(e) = μ(u₁, u₂) ᴧ μ(u₂, u₃) ᴧ … ᴧ μ(u_n-1, u_n) ≤ σ(u₁) ᴧ σ(u_n), if e = (u₁, u₂, …, u_n), n ≥ 2 is an edge in the semigraph G