- Full text PDF available (15)
In this paper, we introduce a new class of sets called τ *-generalized closed sets and τ *-generalized open sets in topological spaces and study some of their properties .
We introduce a new set called smg-closed which are defined on a family of sets satisfying some minimal conditions. It is investigated that this set is a stronger form of mg-closed sets due to T. Noiri. This set enable us to unify certain kind of modifications of strongly generalized closed sets due to Sundaram and Pushpalatha .
In this paper, we define the notions of inverse strong non-split r-dominating set and inverse strong non-split r-domination number γ′ sns r(G) of a graph G. We characterize graphs for which γ sns r(G) + γ′ sns r(G) = n, where γ sns r(G) is the strong non-split r-domination number of G. We get many bounds on γ′ sns r(G). Nordhaus-Gaddum type results are also… (More)
In this paper we introduce rw-closed map from a topological space X to a topological space Y as the image of every closed set is rw-closed and also we prove that the composition of two rw-closed maps need not be rw-closed map. We also obtain some properties of rw-closed maps. Generalized closed mappings were introduce and studied by Malghan.wg-closed… (More)
The aim of this paper is to introduce and study the concepts of prefilters in intuitionistic fuzzy topological spaces.
A bijection f: (X,) → (Y, σ) is called regular weakly homeomorphism if f and f-1 are rw-continuous. Also we introduce new class of maps namely rw-homeomorphism. This class of maps is closed under composition of maps.
The conventional techniques and algorithms employed by forensic scientists to assist in the identification of individuals on the basis of their respective Deoxyribonucleic acid base(DNA) pair profiles involves more computational steps and mathematical formulas that leads to more complexity. DNA identification is not considered by many as a biometric… (More)
Let G = (V, E) be a simple graph. A subset Dof V (G) is a (k, r)-dominating set if for every vertexv ∈ V − D, there exists at least k ver-tices in D which are at a distance utmost r from v in . The minimum cardinality of a (k, r)-dominating set of G is called the (k, r)-domination number of G and is denoted by γ (k,r) (G). In this paper, minimal (k,… (More)
In this paper, we have introduced a new classes of closed sets, as weaker forms of closed sets namely sc*g-closed sets and continuous functions in topological spaces.
LetG = (V, E) be a simple graph. Let u ∈ V (G). u is said to be β 0 good if u is contained in a β 0-set of G. u is said to beβ 0-bad if there exists noβ 0-set of G containing u. A graph G is said to be β 0 excellent if every vertex of G is β 0-good. In this paper, many results on β 0 excellent are obtained. And some relation between some other parameters… (More)