• Publications
  • Influence
Doubly connected domination in the corona and lexicographic product of graphs
Let G be a simple connected graph. A connected dominating set S ⊆ V (G) is called a doubly connected dominating set of G if the subgraph 〈V (G)\S〉 induced by V (G)\S is connected. In this paper, weExpand
  • 11
  • 1
  • PDF
Isolate domination in the join and corona of graphs
A subset S ⊆ V (G) is called an isolate set if the subgraph induced by S has an isolated vertex. This set S is called an isolate dominating set if it is both isolate and dominating. The minimumExpand
  • 5
  • PDF
Secure doubly connected domination in graphs
In this paper, we introduced a new domination parameter called secure doubly connected domination number of a graph. Specifically, if G is a connected graph, we denote by γscc(G) the secure doublyExpand
  • 7
  • PDF
Restrained-isolate domination in graphs
  • Benjier H. Arriola
  • Mathematics
  • 12th International Conference on Mathematics…
  • 1 October 2016
A dominating set S ⊆ V (G) of a simple graph G is called a restrained-isolate dominating set of G if the subgraph 〈S〉 induced by S has an isolated vertex and the subgraph 〈V (G) ∖ S〉 induced by V (G)Expand
Doubly isolate domination in graphs
A set S ⊆ V (G) is said to be an isolate dominating set of G if 〈S〉 has isolated vertex. In this paper, we initiated and introduced new variant of domination called doubly isolate dominating setExpand
  • 1
  • PDF
Contributions of Madrasah Education Program to Counter Violent Extremism
This paper assessed the perceptions of the Arabic teachers (Asatidz) and some narratives of the School Heads on the contributions of the Madrasah Education Program (MEP) as Counter Violent ExtremismExpand
Doubly connected domination in the join and Cartesian product of some graphs
Let G be a simple connected graph. A connected dominating set S ⊂ V(G) is called a doubly connected dominating set of G if the subgraph 〈V(G)\S〉 induced by V(G)\S is connected. We show that given anyExpand
  • 1
Secure doubly connected domination in the join of graphs
TLDR
We characterized the secure doubly connected domination in the join of two graphs and obtain that 2 ≤ γscc(G+H) ≤ 4 for non-complete graphs G. Expand
Divisibility Test for Gaussian Integers
Gaussian integers is a set of complex integers a + bi where both a and b are integers. Long division still the effective method to test the divisibility of a Gaussian integer by another GaussianExpand
A NOTE ON SOME DOMINATION OF FUZZY GRAPHS
  • 1