Minimum equitable dominating Randic energy of a graph REED(G) of some graphs are worked out and bounds on REED(G) are obtained.</div
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
In this paper, we give two upper bounds for the extended energy of a graph one in terms of ordinary ...
In this paper, we consider the energy of a simple graph with respect to its normalized Laplacian ei...
In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed t...
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...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
In this paper, we introduce the concept of minimum dominating color energy of a graph.</div
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...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
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...
Using majorization, we give new bounds for the resolvent energy of general bipartite graphs. We als...
Let G be a finite simple undirected graph with n vertices and m edges. The energy of a graph G , den...
Dominating energy of graphs plays a vital role in the field of application in energy. Results by app...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
In this paper, we give two upper bounds for the extended energy of a graph one in terms of ordinary ...
In this paper, we consider the energy of a simple graph with respect to its normalized Laplacian ei...
In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed t...
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...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
In this paper, we introduce the concept of minimum dominating color energy of a graph.</div
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...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
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...
Using majorization, we give new bounds for the resolvent energy of general bipartite graphs. We als...
Let G be a finite simple undirected graph with n vertices and m edges. The energy of a graph G , den...
Dominating energy of graphs plays a vital role in the field of application in energy. Results by app...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
In this paper, we give two upper bounds for the extended energy of a graph one in terms of ordinary ...
In this paper, we consider the energy of a simple graph with respect to its normalized Laplacian ei...
DOI
Add to ORKG