DOMINATING FUNCTIONS OF CORONA PRODUCT GRAPH OF AND

Main Article Content

S Jeelani Begum
C Shobha Rani
B Maheswari
G S S Raju
S Gouse Mohiddin

Abstract

Let G be a simple graph with vertex set V and edge set E. A subset D of a vertex set V is known as dominating set of G, if for every vertex v in V-D, there exists a vertex u in D such that (u, v) E. Let be a graph and a function is called a dominating function (DF) of , if , for each . The dominating function of is called a minimal dominating function, if for all , is not a dominating function. In this paper we study dominating functions of corona product graph of complete graph Kn with path Pn.

Downloads

Download data is not yet available.

Article Details

Section
Articles