New Bounds for the Generalized Distance Spectral Radius/Energy of Graphs

Yuzheng Ma, Yubin Gao, Yanling Shao and Yusuf Gurefe

Mathematical Problems in Engineering, 2022, vol. 2022, 1-9

Abstract: Let G be a simple connected graph with vertex set VG=v1,v2,…,vn and dvi be the degree of the vertex vi. Let DG be the distance matrix and TrG be the diagonal matrix of the vertex transmissions of G. The generalized distance matrix of G is defined as DαG=αTrG+1−αDG, where 0≤α≤1. If λ1,λ2,…,λn are the eigenvalues of DαG, then the generalized distance spectral radius of G is defined as Ï DαG=max1≤i≤nλi. The generalized distance energy of G is EDαG=∑i=1n|λi−2αWG/n|, where WG is the Wiener index of G. In this paper, we give some bounds of the generalized distance spectral radius and the generalized distance energy.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/9562730.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/9562730.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:9562730

DOI: 10.1155/2022/9562730

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().