On spectral radius and Nordhaus-Gaddum type inequalities of the generalized distance matrix of graphs

Keywords:
distance matrix, generalized distance matrix, spectral radius, generalized distance energy, Nordhaus-Gaddam type inequalityAbstract
If Tr(G) and D(G) are respectively the diagonal matrix of vertex transmission degrees and distance matrix of a connected graph G, the generalized distance matrix Dα(G) is defined as Dα(G)=α Tr(G)+(1−α) D(G), where 0≤α≤1. If ρ1≥ρ2≥⋯≥ρn are the eigenvalues of Dα(G), the largest eigenvalue ρ1 (or ρα(G)) is called the spectral radius of the generalized distance matrix Dα(G). The generalized distance energy is defined as EDα(G)=∑ni=1|ρi−2αW(G)n|, where W(G) is the Wiener index of G. In this paper, we obtain the bounds for the spectral radius ρα(G) and the generalized distance energy of G involving Wiener index. We derive the Nordhaus-Gaddum type inequalities for the spectral radius and the generalized distance energy of G.