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

Authors

  • M. Merajuddin Aligarh Muslim University, Aligarh, India
  • S. Bhatnagar Aligarh Muslim University, Aligarh, India
  • S. Pirzada University of Kashmir, 190006, Srinagar, Kashmir, India https://orcid.org/0000-0002-1137-517X
https://doi.org/10.15330/cmp.14.1.185-193

Keywords:

distance matrix, generalized distance matrix, spectral radius, generalized distance energy, Nordhaus-Gaddam type inequality
Published online: 2022-06-23

Abstract

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

How to Cite
(1)
Merajuddin, M.; Bhatnagar, S.; Pirzada, S. On Spectral Radius and Nordhaus-Gaddum Type Inequalities of the Generalized Distance Matrix of Graphs. Carpathian Math. Publ. 2022, 14, 185-193.