Laplacian Minimum Pendant Dominating Partition Energy of a Graph

Abstract

Let  be any graph. A dominating set  in  is called a pendant dominating set if induced subgraph of  contains at least one pendant vertex. The least cardinality of the pendant dominating set in G is called the pendant domination number of , denoted b In this paper, we define, compute and study the Laplacian minimum pendant dominating ‘ partition energy of some standard familie’s graphs . Further we also establish upper and lower bounds for Laplacian minimum pendant dominating partition energy of a graph