Let G = (V, E) be a non-empty, finite, simple graph. A dominating set of a graph G containing a minimum dominating set of G is called a - endowed dominating set of G. If that set is of cardinality k then it is called a k – endowed dominating set. k - enresdowed graph is one in which every restrained dominating set of cardinality k contains a minimum restrained dominating set. Tree is one of the most studied and practically useful classes of graphs and is the attention of a great number of studies. In this paper the enresdowedness property of trees with diameter four is found.
Volume 11 | 04-Special Issue
Pages: 2432-2439