Exact Pendant Edge Domination in Graphs

Let G = (V, E) be a connected graph. A pendant edge dominating set F of G is called a exact pendant edge dominating set (expedset), if the edge induced subgraph 〈𝑵(𝑭)〉contains at least one pendant edge. The minimum cardinality of a expedset of G is called the exat pendant edge domination number of G and is denoted by 𝜸 ᇱ 𝒆𝒑𝒆(𝑮). In this paper We initiate a study of this parameter.