A. P. Pushpalatha

  • Citations Per Year
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 γ′snsr(G) of a graph G. We characterize graphs for which γsnsr(G) + γ′snsr(G) = n, where γsnsr(G) is the strong non-split r-domination number of G. We get many bounds on γ′snsr(G). Nordhaus-Gaddum type results are also obtained(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 vertices 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)
Levine , N., Semi-open sets and semi-continuity in topological spaces, Amer.Math.Monthly,70(1963),36-41. Levine , N., Generalized closed sets in topology, Rend. Circ. Mat. Palermo, 19(1970),89-96. Maki., Devi, R., and Balachandran, K., Generalized α-closed sets in topology, Bull. Fukuoka Univ. Ed. Part III, 42(1993), 13-21. Hatir, E., Noiri, T., and Yuksel,(More)
In this paper, some fundamental technical concepts of the main multiple access schemes for wireless mobile systems are reviewed, and a path for development of appropriate multiple access technologies for next-generation mobile networks, or so-called beyond 3G (B3G), is established. We first review the multiple access technologies in secondand(More)
Malicious and selfish behaviors represent a serious threat against routing in Delay/Disruption Tolerant Networks (DTNs).We propose an iTrust, a probabilistic misbehavior detection scheme, for secure DTN routing towards efficient trust establishment. The basic idea of iTrust is introducing a periodically available Trusted Authority (TA) to judge the node’s(More)
Let G = (V, E) be a simple, finite, undirected graph. Let k, r be positive integers. A set S  V (G) is called (k, r)-semi strongly stable set if | (u) S|  k, for all u V (G). A partition of V(G) into (k, r)-semi strongly stable sets is called (k, r)-semi strong coloring of G. The minimum order of a (k, r)-semi strong coloring of G is called (k, r)-semi(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)
  • 1