Minimum Boundary Dominating Color Energy of a Graph

K. N Prakasha, B. V Shwetha

Abstract


In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(G) and compute the minimum boundary dominating color energy EcD(G) of few families of graphs . We establish the bounds for minimum boundary dominating color energy.


Full Text:

PDF

Refbacks

  • There are currently no refbacks.