Abstract Let G be a graph with n vertices and m edges. The term energy of a graph G was introduced by I. Gutman in chemistry due to its relevance to the total π-electron energy of a carbon compound. An analogous energy ED(G) $\mathcal{E}_{D}(G)$, called the distance energy, was defined by Indulal et al. (MATCH Commun. Math. Comput. Chem. 60:461–472, 2008) in 2008. McClelland and Koolen–Moulton bounds for distance energy were established subsequently by Ramane et al. (Kragujev. J. Math. 31:59–68, 2008). The lower and upper bounds for ED(G) $\mathcal{E}_{D}(G)$ obtained in this paper are better than the McClelland and Koolen–Moulton bounds
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) ...
Let G be a simple undirected connected graph, then DαG=αTrG+1−αDG is called the α-distance matrix of...
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...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G...
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^...
Given a simple connected graph G, let D(G) be the distance matrix, DL(G) be the distance Laplacian m...
Three main tools to study graphs mathematically are to make use of the vertex degrees, distances and...
The generalized distance matrix of a connected graph $G$, denoted by $D_{\alpha}(G)$, is defined as ...
Let G be a connected, nontrivial graph with vertex set V (G) and edge set E(G) and let |V (G)| = n a...
The energy of a graph began with German physicist, Erich H¨uckel’s 1931 paper, Quantenttheoretische ...
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) ...
This paper includes new bounds concepting the Seidel incidence energy. In the sequel, improved bound...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
The distance energy of a graph is defined as the sum of absolute values of distance eigenvalues of t...
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) ...
Let G be a simple undirected connected graph, then DαG=αTrG+1−αDG is called the α-distance matrix of...
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...
Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we intro...
The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G...
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^...
Given a simple connected graph G, let D(G) be the distance matrix, DL(G) be the distance Laplacian m...
Three main tools to study graphs mathematically are to make use of the vertex degrees, distances and...
The generalized distance matrix of a connected graph $G$, denoted by $D_{\alpha}(G)$, is defined as ...
Let G be a connected, nontrivial graph with vertex set V (G) and edge set E(G) and let |V (G)| = n a...
The energy of a graph began with German physicist, Erich H¨uckel’s 1931 paper, Quantenttheoretische ...
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) ...
This paper includes new bounds concepting the Seidel incidence energy. In the sequel, improved bound...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
The distance energy of a graph is defined as the sum of absolute values of distance eigenvalues of t...
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) ...
Let G be a simple undirected connected graph, then DαG=αTrG+1−αDG is called the α-distance matrix of...
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...