Nonsplit Perfect Triple Connected Domination Number of a Graph
Gopalakrishnan Mahadevan, A. Iravithul Basira, C. Sivagnanam · Asian Journal of Research in Social Sciences and Humanities · 2016
In this paper, we introduce the concept of nonsplit perfect triple connected domination number of a graph. A subset S of V of a non trivial graph G is said to be nonsplit perfect triple connected dominating set if S is a triple connected dominating set and is connected and has at least one perfect matching. The minimum cardinality taken over all nonsplit perfect triple connected dominating sets in G is called the nonsplit perfect triple connected domination number of G and is denoted by (G). We initiate to study this parameter and investigate its relationship with chromatic number.