Add to ORKGRecently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we introduced the concept of minimum dominating distance energyEDd(G) of a graph G and computed minimum dominating distance energies of a Stargraph,Complete graph,Crown graph and Cocktail graphs. Upper and lower boundsfor EDd(G) are also established.DOI : http://dx.doi.org/10.22342/jims.20.1.133.19-2
In this paper, the distance laplacian energy for distance matrix is examined. Some bounds for the la...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
AbstractThe minimum eccentric dominating graph MmDE(G) of a graph G is defined to be the intersectio...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
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...
Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is cal...
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 generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G...
For an integer $k \ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of v...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
AbstractThe energy of a graph is defined as the sum of the absolute values of the eigenvalues of its...
Abstract Let G be a graph with n vertices and m edges. The term energy of a graph G was introduced b...
The concept of a new kind of graph energy, namely, minimum covering energy, denoted by Ec(G), was in...
In this paper, we introduce the concept of minimum dominating color energy of a graph.</div
In this paper, the distance laplacian energy for distance matrix is examined. Some bounds for the la...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
AbstractThe minimum eccentric dominating graph MmDE(G) of a graph G is defined to be the intersectio...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
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...
Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is cal...
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 generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G...
For an integer $k \ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of v...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
AbstractThe energy of a graph is defined as the sum of the absolute values of the eigenvalues of its...
Abstract Let G be a graph with n vertices and m edges. The term energy of a graph G was introduced b...
The concept of a new kind of graph energy, namely, minimum covering energy, denoted by Ec(G), was in...
In this paper, we introduce the concept of minimum dominating color energy of a graph.</div
In this paper, the distance laplacian energy for distance matrix is examined. Some bounds for the la...
In this paper, we introduce the concept of minimum boundary dominating color energy of a graph, EcD(...
AbstractThe minimum eccentric dominating graph MmDE(G) of a graph G is defined to be the intersectio...