Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Secure convex domination in a graph

- E. L. Enriquez, S. Canoy
- Mathematics
- 2015

TLDR

23- PDF

On a variant of convex domination in a graph

- E. L. Enriquez, S. Canoy
- Mathematics
- 2015

Abstract A dominating set S which is also convex is called a convex dominating set of G. A convex dominating set S of V (G) is a restrained convex dominating set of G if for each u ∈ V (G) \ S, there… Expand

20- PDF

Outer-convex domination in graphs

- J. Dayap, E. L. Enriquez
- Mathematics, Computer Science
- Discret. Math. Algorithms Appl.
- 1 February 2020

TLDR

8

Perfect Outer-connected Domination in the Join and Corona of Graphs

- E. L. Enriquez, Valerie Verallo Fernandez, Teodora J. Punzalan, J. Dayap
- Mathematics
- 17 June 2017

6

Inverse Clique Domination in Graphs

- C. M. Loquias, E. L. Enriquez, J. Dayap
- Mathematics
- 17 June 2017

Let G be a connected simple graph. A nonempty subset S of the vertex set V (G) is a clique in G if the graph induced by S is complete. A clique S in G is a clique dominating set if it is a dominating… Expand

9

Disjoint Secure Domination in the Join of Graphs

- J. Dayap, E. L. Enriquez
- Mathematics
- 17 June 2017

Let G = (V(G),E(G)) be a simple connected graph. A dominating set S in G is called a secure dominating set in G if for every u ∈ V (G) \ S, there exists v ∈ S ∩ NG(u) such that (S \ {v}) ∪ {u} is a… Expand

3

z-DOMINATION IN GRAPHS

- Nanet Altubar Goles, E. L. Enriquez, C. M. Loquias, G. Estrada, Romeo C. Alota
- Mathematics
- 18 November 2018

Let be a connected simple graph. A subset of a vertex setis a dominating set of if for every vertex there exists a vertexsuch thatis an edge of Let be a minimum dominating set in The dominating set… Expand

1

ON RESTRAINED CLIQUE DOMINATION IN GRAPHS

- E. L. Enriquez
- Mathematics
- 18 December 2017

Abstract: Let be a connected simple graph. A nonempty subset of the vertex set is a clique in if the graph induced by is complete. A clique in is a clique dominating set if it is a… Expand

5

Outer-Clique Domination in Graphs

- E. L. Enriquez, Jovita N. Ravina, Valerie Verallo Fernandez
- Mathematics
- 31 July 2018

Let be a simple graph. A set of vertices of a graph is an outer-clique dominating set if every vertex not in is adjacent to some vertex inand the subgraph induced by is clique. In this paper, we… Expand

Super Fair Dominating Set in the Cartesian Product of Graphs

- Glenna T. Gemina, E. L. Enriquez
- Mathematics
- 6 June 2020

In this paper, we characterize the super fair dominating set in the Cartesian product of two graphs and give some important results.

2

...

1

2

3

4

5

...