• Publications
• Influence
Convex Sets Under Some Graph Operations
• Mathematics, Computer Science
• Graphs Comb.
• 1 December 2002
We characterize convex sets of graphs resulting from some binary operations, and compute the convexity numbers of the resulting graphs. Expand
• 35
• 3
On the hull sets and hull number of the cartesian product of graphs
• Mathematics, Computer Science
• Discret. Math.
• 28 October 2004
We give the hull number of the Cartesian product of a nontrivial connected graph and complete graph. Expand
• 26
• 2
• PDF
On the Hull Number of the Composition of Graphs
• Computer Science, Mathematics
• Ars Comb.
• 2005
• 15
• 1
Convex domination in the composition and cartesian product of graphs
• 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 aExpand
• 11
• 1
• PDF
Doubly connected domination in the corona and lexicographic product of graphs
• 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, weExpand
• 11
• 1
• PDF
Locating sets in a graph
• Computer Science
• 2015
We characterize the locating sets in the join and corona of graphs and determine the locating numbers of these graphs. Expand
• 1
• 1
• PDF
Monophonic numbers of the join and composition of connected graphs
• Mathematics, Computer Science
• Discret. Math.
• 1 May 2007
In this paper, we describe the monophonic sets in the join and composition of two connected graphs and the composition G[K"n] of a connected graph. Expand
• 20
Locating Total Dominating Sets in the Join, Corona and Composition of Graphs
• 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 GExpand
• 3
• PDF
Secure convex domination in a graph
• Mathematics
• 2015
We show that given positive integers k and n such that n ≥ 4 and 1 ≤ k ≤ n, there exists a connected graph G with |V (G)| = n and γscon(G) = k. Expand
• 22
• PDF