In this paper we introduce new class of open sets called weak N-open sets and we study the relation between N-open sets , weak N-open sets and some other open sets. We prove several results about them.
The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X , ï´ ) be a topological space, and let A ⊆, then Ais called semi-preopen set if ⊆∘ . In this paper, we study the properties of semi-preopen sets but by another definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.
The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X , ï´ ) be a topological space, and let A ⊆, then A is called semi-preopen set if ⊆∘ . In this paper, we study the properties of semi-preopen sets but by another definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.
In this paper, Nordhaus-Gaddum type relations on open support independence number of some derived graphs of path related graphs under addition and multiplication are studied.
Background: Venous thromboembolic (VTE) disease with i t ' s h i g h morbidity and mo r t a l i t y is currently one of the most serious postoperative complication, (DVT) can lead to
fatal pulmonary embolism (PE). or the development of post thrombotic syndrome.
Patients and methods: This is a prospective study which was carried on 85 patients had s i n g l e lower l i m b open fracture with no other major i n j u r i e s in other sites of body
(with the exception of superficial wounds or b r u i s e s ) .They were d i v i d e d i n t o groups according to age, gender, weight, type of fracture, methods of immobilization, duration of
h o s p i t a l i z a t i o n , duration of operation. All the patients includin
This work is a trial to ensure the absolute security in any quantum cryptography (QC) protocol via building an effective hardware for satisfying the single-photon must requirement by controlling the value of mean photon number. This was approximately achieved by building a driving circuit that provide very short pulses (≈ 10 ns) for laser diode -LD- with output power of (0.7-0.99mW) using the available electronic components in local markets. These short pulses enable getting faint laser pulses that were further attenuated to reach mean photon number equal to 0.08 or less.
A new class of generalized open sets in a topological space, called G-open sets, is introduced and studied. This class contains all semi-open, preopen, b-open and semi-preopen sets. It is proved that the topology generated by G-open sets contains the topology generated by preopen,b-open and semi-preopen sets respectively.
In this paper, the linear system of Fredholm integral equations is solving using Open Newton-Cotes formula, which we use five different types of Open Newton-Cotes formula to solve this system. Compare the results of suggested method with the results of another method (closed Newton-Cotes formula) Finally, at the end of each method, algorithms and programs developed and written in MATLAB (version 7.0) and we give some numerical examples, illustrate suggested method
In this paper we introduced a new class of - called - and study their basic properties in nano topological spaces. We also introduce -closure and -interior and study some of their fundamental properties.
Suppose that is a finite group and is a non-empty subset of such that and . Suppose that is the Cayley graph whose vertices are all elements of and two vertices and are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by that is a graph with vertex set consists of all column matrices which all components are in and two vertices and are adjacent if and only if , where is a column matrix that each entry is the inverse of similar entry of and is matrix with all entries in , is the transpose of and . In this paper, we clarify some basic properties of the new graph and assign the structure of when is complete graph , complete bipartite graph and complete
... Show More