EXACT PENDANT EQUITABLE DOMINATION IN GRAPHS
Main Article Content
Abstract
Let be any graph. An exact equitable dominating set in is said to be an Exact pendant equitable dominating set if induced sub graph of contains at least one pendant vertex. The least cardinality of Exact pendant equitable set in is called the Exact pendant equitable domination number of , denoted by . In this article, we study the exact pendant domination number for some well known standard graph and also bounds for Exact pendant equitable domination number.
Let be any graph. An exact equitable dominating set in is said to be an Exact pendant equitable dominating set if induced sub graph of contains at least one pendant vertex. The least cardinality of Exact pendant equitable set in is called the Exact pendant equitable domination number of , denoted by . In this article, we study the exact pendant domination number for some well known standard graph and also bounds for Exact pendant equitable domination number.