Let G bea connected simple graph. A dominating set S⊆ VG is called a perfect dominating
set of G if every u∈ VG\Sis dominated by exactly one element of S. Let D be a minimum …

Let be a connected simple graph. A restrained dominating set of the vertex set of,, is a
secure restrained dominating set of if for each\, there exists such that and the set\is a …

The purpose of this paper is to introduce a new inverse domination parameter in the graphs
it is called inverse co-even domination number. Some properties of the theory to this …

Let G=(V (G), E (G)) be a connnected simple graph. A subset S of V (G) is a dominating set of
G if for every u ε V (G)\S, there exists v ε S such that u, v ε E (G). A dominating set S is called …

Let G be a connected simple graph. A dominating set S⊆ V (G) is called a perfect
dominating set of G if each u∈ V (G)\S is dominated by exactly one element of S. The perfect …

Let G be a connected simple graph and let D be a minimum dominating set of G. A
dominating set S⊆ VG∖ D is an inverse dominating set of G with respect to D. The set S is …

In this paper, we show that every integers k, m, and n with 1≤ k≤ m< n is realizable as
inverse domination number, inverse secure domination number, and order of G respectively …

On Pairs of Disjoint Dominating Sets in a Graph 1 Introduction Page 1 International Journal
of Mathematical Analysis Vol. 10, 2016, no. 13, 623 - 637 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2016.6343 …

We consider a graph ܩ ൌ ሺܸǡ ܧሻ as a simple, finite and undirected with vertex set ܸሺܩሻ
and edge set ܧሺܩሻ. Through this worN, the study of the new concept “inverse whole …

Let be a finite group and e be its identity. Let Sbe a generating set of G such that and for all.
Then the Cayley Graph is defined by, where and denoted by. The Unitary Cayley Graph, is …