• Publications
• Influence
Weakly connected independent domination in the join of graphs
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 inExpand
• 6
• PDF
Weakly convex and weakly connected independent dominations in the corona of graphs
• 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 weaklyExpand
• 11
• PDF
Independent non-split domination in the join and corona of graphs
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 andExpand
Restrained Weakly Connected Domination in the Join and Corona of Graphs
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 ofExpand
Secure Weakly Convex Domination in Graphs
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
We determine the secure weakly connected dominating sets of the join K1 +G and the corona of two graphs and, compute their corresponding weaklyconnected domination numbers. Expand
Connected 2-Domination in the Join of Graphs
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, weExpand
• 1
• PDF
Connected 2-domination in the corona of graphs
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, weExpand
Secure weakly connected domination in the join of graphs
• Computer Science
• 2015
In this paper, we take a look at the secure weakly connected domination in the join of graphs and give necessary and sufficient conditions for the join to have secure weak connected domination. Expand