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.
The main idea of this research is to study fibrewise pairwise soft forms of the more important separation axioms of ordinary bitopology named fibrewise pairwise soft
In this paper we show that if ? Xi is monotonically T2-space then each Xi is monotonically T2-space, too. Moreover, we show that if ? Xi is monotonically normal space then each Xi is monotonically normal space, too. Among these results we give a new proof to show that the monotonically T2-space property and monotonically normal space property are hereditary property and topologically property and give an example of T2-space but not monotonically T2-space.
In this work we explain and discuss new notion of fibrewise topological spaces, calledfibrewise soft ideal topological spaces, Also, we show the notions of fibrewise closed soft ideal topological spaces, fibrewise open soft ideal topological spaces and fibrewise soft near ideal topological spaces.
This research presents the concepts of compatibility and edge spaces in
The main purpose of this paper is to introduce a some concepts in fibrewise totally topological space which are called fibrewise totally mapping, fiberwise totally closed mapping, fibrewise weakly totally closed mapping, fibrewise totlally perfect mapping fibrewise almost totally perfect mapping. Also the concepts as totally adherent point, filter, filter base, totally converges to a subset, totally directed toward a set, totally rigid, totally-H-set, totally Urysohn space, locally totally-QHC totally topological space are introduced and the main concept in this paper is fibrewise totally perfect mapping in totally top
This study examines traveling wave solutions of the SIS epidemic model with nonlocal dispersion and delay. The research shows that a key factor in determining whether traveling waves exist is the basic reproduction number R0. In particular, the system permits nontrivial traveling wave solutions for σ≥σ∗ for R0>1, whereas there are no such solutions for σ<σ∗. This is because there is a minimal wave speed σ∗>0. On the other hand, there are no traveling wave solutions when R0≤1. In conclusion, we provide several numerical simulations that illustrate the existence of TWS.
We introduce in this paper some new concepts in soft topological spaces such as soft simply separated, soft simply disjoint, soft simply division, soft simply limit point and we define soft simply connected spaces, and we presented soft simply Paracompact spaces and studying some of its properties in soft topological spaces. In addition to introduce a new types of functions known as soft simply
Let M be a n-dimensional manifold. A C1- map f : M M is called transversal if for all m N the graph of fm intersect transversally the diagonal of MM at each point (x,x) such that x is fixed point of fm. We study the minimal set of periods of f(M per (f)), where M has the same homology of the complex projective space and the real projective space. For maps of degree one we study the more general case of (M per (f)) for the class of continuous self-maps, where M has the same homology of the n-dimensional sphere.
Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show More