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

Publications Influence

Weakly connected independent domination in the join of graphs

- Rene E. Leonida
- Mathematics
- 2013

In this paper, we explore the concept of restrained weakly connected independent domination in graphs. In particular, we characterized the restrained weakly connected independent dominating sets in… Expand

6- PDF

Weakly convex and weakly connected independent dominations in the corona of graphs

- Rene E. Leonida, S. Canoy
- Mathematics
- 2013

In this paper we constructed a connected graph with a preassigned order, weakly convex domination number, convex domination number, weakly connected independent domination number, and upper weakly… Expand

11- PDF

Independent non-split domination in the join and corona of graphs

- Rene E. Leonida
- Mathematics
- 2015

In this paper, we explore the concept of independent non-split domination in graphs. In particular, we characterized the independent non-split dominating sets of the join and corona of graphs and… Expand

Restrained Weakly Connected Domination in the Join and Corona of Graphs

- Rene E. Leonida
- Mathematics
- 2015

In this paper, we explore the concept of restrained weakly connected domination in graphs. In particular, we characterized the restrained weakly connected dominating sets in the join and corona of… Expand

Secure Weakly Convex Domination in Graphs

- Rene E. Leonida
- Mathematics
- 2015

In this paper, we investigate the concept of secure weakly convex domination set of some graphs. We characterized those graphs for which the secure weakly convex domination numbers are 1 and 2.… Expand

Secure weakly connected domination in the corona of graphs

- Rene E. Leonida
- Computer Science
- 2015

TLDR

Connected 2-Domination in the Join of Graphs

- Rene E. Leonida
- 2015

A connected 2-dominating set of a graph G is a set S of vertices of G such that every vertex not in S is dominated at least twice and the subgraph induced by S is connected. In this paper, we… Expand

1- PDF

Restrained weakly connected independent domination in the join of graphs

- Rene E. Leonida
- Mathematics
- 2015

Connected 2-domination in the corona of graphs

- Rene E. Leonida
- Physics
- 2015

A connected 2-dominating set of a graph G is a set S of vertices of G such that every vertex not in S is dominated at least twice and the subgraph induced by S is connected. In this paper, we… Expand

Secure weakly connected domination in the join of graphs

- Rene E. Leonida, Rendon A. Dela Cruz, Emmylou M. Aujero, Marchelle A. Deleverio, Nimfa L. Bodegas
- Computer Science
- 2015

TLDR