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 ...

The paired dominating set D of graph G is the subset of vertex set of graph G such that the subset D is dominating set and the subgraph induced by D contains perfect Matching. The paired domination number is the minimum ...

The mathematical combinatorics is a subject that applying combinatorial notion to all mathematics and all sciences for understanding the reality of things in the universe, motivated by CC Conjecture of Dr.Linfan MAO on ...

A proper k - coloring of a graph G is a function f : V(G) → {1,2,..., k} such that f(u) 6= f(v) for all uv ∈ E(G). The color class Si is the subset of vertices of G that is assigned to color i. The chromatic number χ(G) ...

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 ...