Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Convex Sets Under Some Graph Operations
TLDR
On the hull sets and hull number of the cartesian product of graphs
- Gilbert B. Cagaanan, S. Canoy
- Mathematics, Computer Science
- Discret. Math.
- 28 October 2004
TLDR
On the Hull Number of the Composition of Graphs
- S. Canoy, Gilbert B. Cagaanan
- Computer Science, Mathematics
- Ars Comb.
- 2005
- 15
- 1
Convex domination in the composition and cartesian product of graphs
- M. A. Labendia, S. Canoy
- Mathematics
- 1 December 2012
In this paper we characterize the convex dominating sets in the composition and Cartesian product of two connected graphs. The concepts of clique dominating set and clique domination number of a… Expand
Doubly connected domination in the corona and lexicographic product of graphs
- Benjier H. Arriola, S. Canoy
- Mathematics
- 2014
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, we… Expand
Locating sets in a graph
TLDR
On the Geodetic Covers and Geodetic Bases of the Composition G[Km]
- Gilbert B. Cagaanan, S. Canoy
- Computer Science, Mathematics
- Ars Comb.
- 2006
- 6
Monophonic numbers of the join and composition of connected graphs
- E. M. Paluga, S. Canoy
- Mathematics, Computer Science
- Discret. Math.
- 1 May 2007
TLDR
Locating Total Dominating Sets in the Join, Corona and Composition of Graphs
- Benjamin N. Omamalin, S. Canoy, H. M. Rara
- Mathematics
- 2014
Let G =( V (G),E(G)) be a connected graph. A subset S of V (G) is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of G… Expand
Secure convex domination in a graph
- E. L. Enriquez, S. Canoy
- Mathematics
- 2015
TLDR