Abstract :
Abstract Let be connected graph. A dominating set in is said to be a leaf dominating set if must have at least one leaf vertex. The least number of a leaf dominating set is said to be leaf domination number, represented by Any minimal dominating set with the least amount of cardinality is called the set. In this work, we determine leaf domination number and calculate leaf domination number for standard graphs.
Keyword :
Keywords: Domination Number, Isolate Domination, Wheel graph, Ladder graph, Pan graph