Steiner domination decomposition number of graphs

Abstract

In this paper, we introduce a new concept Steiner domination decomposition number of graphs. Let be a connected graph with Steiner domination numberA decomposition of is said to be a Steiner Domination Decomposition if Steiner domination decomposition number of is the maximum cardinality obtained for an of and is denoted as Bounds on are presented. Also, few characteristics of the subgraphs belonging to of maximum cardinality are discussed

Keywords

• subgraphs
• domination
• decomposition number