The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular D-equienergetic graphs of diameter 2, on p = 3t + 1 vertices are also constructed
AbstractThe D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance mat...
Let G is a connected simple graph and V(G) = {v1, v2, ..., vp} is vertex set of G. The distance matr...
The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D an...
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) ...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
The D-eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and form the ...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
The generalized distance matrix of a connected graph $G$, denoted by $D_{\alpha}(G)$, is defined as ...
The D-eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and form the ...
The complementary distance (CD) matrix of a graph $G$ is defined as $CD(G) = [c_{ij}]$, where $c_{ij...
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^...
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of ...
In this paper, we give two upper bounds for the extended energy of a graph one in terms of ordinary ...
The Detour matrix (DD) of a graph has for its ( i , j) entry the length of the longest path between ...
The path eigenvalues of a graph $G$ are the eigenvalues of its path matrix. The path energy of a sim...
AbstractThe D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance mat...
Let G is a connected simple graph and V(G) = {v1, v2, ..., vp} is vertex set of G. The distance matr...
The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D an...
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) ...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
The D-eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and form the ...
AbstractThe D-eigenvalues {μ1,μ2,…,…,μp} of a graph G are the eigenvalues of its distance matrix D a...
The generalized distance matrix of a connected graph $G$, denoted by $D_{\alpha}(G)$, is defined as ...
The D-eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and form the ...
The complementary distance (CD) matrix of a graph $G$ is defined as $CD(G) = [c_{ij}]$, where $c_{ij...
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^...
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of ...
In this paper, we give two upper bounds for the extended energy of a graph one in terms of ordinary ...
The Detour matrix (DD) of a graph has for its ( i , j) entry the length of the longest path between ...
The path eigenvalues of a graph $G$ are the eigenvalues of its path matrix. The path energy of a sim...
AbstractThe D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance mat...
Let G is a connected simple graph and V(G) = {v1, v2, ..., vp} is vertex set of G. The distance matr...
The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D an...
Add to ORKG