In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed the minimum dominating Randic energy of graph. Also, established the upper and lower bounds for the minimum equitable dominating Randic energy of a graph.</div
Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for ...
In this research, we explore the subject of graph energy. We first discuss the connections between l...
In the current literature, two interesting and innovative energy concepts of a graph, namely, the co...
Minimum equitable dominating Randic energy of a graph REED(G) of some graphs are worked out and boun...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...
The energy of a graph and its applications to Organic Chemistry are given in detail in two important...
In this paper, we introduce the concept of minimum dominating color energy of a graph.</div
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
Dominating energy of graphs plays a vital role in the field of application in energy. Results by app...
In a graph G = (V,E), a set M ⊆ V is called a monopoly set of G if every vertex v ∈ V −M has at leas...
In this paper we study the special case of set S being dominating set and corresponding domination e...
Let G be a simple graph of order n. The energy E(G) of G is the sum of the absolute values of the e...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...
Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for ...
In this research, we explore the subject of graph energy. We first discuss the connections between l...
In the current literature, two interesting and innovative energy concepts of a graph, namely, the co...
Minimum equitable dominating Randic energy of a graph REED(G) of some graphs are worked out and boun...
A subset D of V is called an equitable dominating set 8 if for every v . V -D there exists a vertex ...
The energy of a graph and its applications to Organic Chemistry are given in detail in two important...
In this paper, we introduce the concept of minimum dominating color energy of a graph.</div
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
Dominating energy of graphs plays a vital role in the field of application in energy. Results by app...
In a graph G = (V,E), a set M ⊆ V is called a monopoly set of G if every vertex v ∈ V −M has at leas...
In this paper we study the special case of set S being dominating set and corresponding domination e...
Let G be a simple graph of order n. The energy E(G) of G is the sum of the absolute values of the e...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...
Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for ...
In this research, we explore the subject of graph energy. We first discuss the connections between l...
In the current literature, two interesting and innovative energy concepts of a graph, namely, the co...
DOI
Add to ORKG