A vertex bimagic total labeling on a graph with v vertices and e edges is a one to one map taking the vertices and edges onto the integers 1, 2, 3, ...v + e with the property that the sum of the label on the vertex and the labels of its incident edges is one of the constants k1 or k2, independent of the choice of the vertex. In this paper we have discussed that bistar Bn,n are vertex bimagic to...

A subset D of ( ) V G is called an equitable dominating set if for every ( ) v V G D   there exists a vertex u D  such that ( ) uv E G  and | ( ) ( ) | 1 deg u deg v   . A subset D of ( ) V G is called an equitable independent set if for any , u D v   ( ) e N u for all { } v D u   . The concept of equi independent equitable domination is a combination of these two important concepts. ...

A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if either ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 if ( ) ( ) f u f v , then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial ...

An injective map f : E(G) → {±1,±2, · · · ,±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f∗ : V (G) → Z − {0} defined by f∗(v) = ∑ e∈Ev f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f∗(V (G)) is either of the form { ±k1,±k2, · · · ,±k p 2 } or { ±k1,±k2, · · · ,±k p−1 2 } ∪ { ±k p+1 2 } according as ...

The selection of insecticide resistance in malaria vectors has the potential to compromise any insecticide-based vector control programme. To ensure that the insecticides used for indoor residual spraying and insecticide-treated nets in Zambia remain effective and their choice is evidence based, insecticide resistance surveillance and monitoring are essential. This study assessed and compared t...

Let G∗ = (V, E) be a simple graph and A any nonempty set of parameters. subset R A×V an arbitrary relation from to V. mapping ᵖ(V) written as F:A → can defined F(x) { y ∈ V/xRy} ᵖ(E) K:A K(x) {uv E/{u, v} ⊆ F(x)}. The pair (F, A) is soft over V the (K, E. Obviously (F(a), K(a)) subgraph for all A. 4-tuple G ( G∗, F, K, called G. In this paper we discuss different graphs such Complete graph, Sta...

Let G be a graph with p vertices and q edges and let = 0,1, 2, , . 2 q A              A vertex labeling   : f V G A  i e a vertex equitable labeling of G if it induces an edge labeling s said to b given by      * =  f uv f u f v  * f such that     1 v a v b   and     * = 1,2,3, , f f f E q  , where   f v a is the ber of verti num ces v with   = f v a for . ...

Consider a robot that is navigating in space represented by graph and wants to know its current location. It can send signal find out how far it from each set of fixed landmarks. We study the problem computing minimum number landmarks required, where they should be placed so always determine The nodes are located called metric basis graph, dimension graph. On other hand, G smallest size ...