A graph with q edges is called antimagic if its edges can be labeled with 1, 2,…,q such that the sums of the labels of the edges incident to each vertex are distinct. Here we prove that the graphs obtained by switching ...

In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem ...

In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem ...

Let G=(V(G),E(G)) be a graph and f E G : ( ) {0,1} → be a binary edge labeling. Define * f V G : ( ) {0,1} → by * ( ) ( ) ( )( 2) uv E G f v f uv mod ∈ = ∑ . The function f is called E-cordial labeling of G if | ...

In this paper we are trying to find that the domination number of any graph is obtain by using familiar method as vertex domination techniques and edge domination techniques but from the both who one is faster than ...

A dominating set S ⊆ V is said to be a restrained dominating set of graph G if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. A set S ⊆ V is called an equitable dominating set if for ...

An Ad-hoc network is one that is spontaneously formed when device connect and communicate with each other. It is mostly wireless local area network (WLANs). The devices communicate with each other directly instead of ...

We introduced Kasaj topological spaces which is a partial extension of Micro topological space which is introduced by S. Chandrasekar. We also analyzed basic properties of some weak open sets in Kasaj topological spaces. ...

Recently, We defined Kasaj-topological space and weak open sets namely Kasaj-pre-open sets, Kasaj-semi-open sets, Kasaj-alpha-open sets, Kasaj-beta-open sets in Kasaj topological spaces and analyzed their basic properties. ...

For a graph G = (V,E), a set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and also to a vertex in V −S. The minimum cardinality of a restrained dominating set of G is called ...