A. P. Pushpalatha

Learn More
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[5].wg-closed(More)
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 [1]. 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)