Independent injective domination of graphs
DOAJ (DOAJ: Directory of Open Access Journals), Jul 1, 2016
An injective dominating set S in a graph G is called independent injective dominating set (IInj-d... more An injective dominating set S in a graph G is called independent injective dominating set (IInj-dominating set) if for every v ∈ S, N (v) ∩ S = φ. The minimum cardinality of such injective dominating set is called independent injective domination number of G and denoted by γ i i n (G). In this paper, we introduce the independent injective domination of graphs and we define the IID-graph. Exact values for some families of graphs, relations with the other domination parameters are obtained. Also, we introduce the independent injective frustration number of graphs. Bounds and some interesting results are established.
Uploads
Papers by Anwar Alwardi