- Full text PDF available (10)
- This year (0)
- Last 5 years (5)
- Last 10 years (10)
Journals and Conferences
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, a new class αcg-closed sets, as weaker forms of closed sets in topological spaces are introduced. Some of its properties are studied. Also we have provided continuity ,closed map and open map are also introduced. Refer ences-Levine , N., Semi-open sets and semi-continuity in topological spaces,
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)
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)
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)
In this paper we introduce and study the concept of a new class of closed set called (i, j)-regular weakly closed set (briefly (i,j)-rw closed set) in bitopological spaces and discuss some of their properties in bitopological spaces.
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)
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 second-and… (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)
In this paper, we investigate the intuitionistic fuzzy net on the intuitionistic fuzzy topological space and we show that there is a relation between the convergence of intuitionistic fuzzy nets and prefilters.