Minimum Dominating Color Energy of a Graph
- P. Siva Kota Reddy (5758630)
- K.N. Prakasha (5759732)
Publication date
September 2018
DOIAbstract
In this paper, we introduce the concept of minimum dominating color energy of a graph.</div
In this paper, we introduce the concept of minimum dominating color energy of a graph.</div
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
International audienceIn this paper, we introduce and study a new coloring prob- lem of a graph call...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
In the current literature, two interesting and innovative energy concepts of a graph, namely, the co...
In this paper, we introduce the concept of color energy of a graph, E C(G) and compute the color ene...
In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed t...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
Every graph G contains a minimum vertex-coloring with the property that at least one color class of ...
The energy of a graph and its applications to Organic Chemistry are given in detail in two important...
AbstractEvery graph G contains a minimum vertex-coloring with the property that at least one color c...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...
Given a colored graph G, its color energy Ec(G) is defined as the sum of the absolute values of the ...
In this paper we study the special case of set S being dominating set and corresponding domination e...
Abstract. In this paper the double dominating energy of a graph is introduced. The double dominating...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
International audienceIn this paper, we introduce and study a new coloring prob- lem of a graph call...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
In the current literature, two interesting and innovative energy concepts of a graph, namely, the co...
In this paper, we introduce the concept of color energy of a graph, E C(G) and compute the color ene...
In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed t...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
Every graph G contains a minimum vertex-coloring with the property that at least one color class of ...
The energy of a graph and its applications to Organic Chemistry are given in detail in two important...
AbstractEvery graph G contains a minimum vertex-coloring with the property that at least one color c...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...
Given a colored graph G, its color energy Ec(G) is defined as the sum of the absolute values of the ...
In this paper we study the special case of set S being dominating set and corresponding domination e...
Abstract. In this paper the double dominating energy of a graph is introduced. The double dominating...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G ...
International audienceIn this paper, we introduce and study a new coloring prob- lem of a graph call...
Add to ORKG