Journal of Lanzhou University of Technology ›› 2023, Vol. 49 ›› Issue (1): 144-151.

• Scientific • Previous Articles     Next Articles

Bounds for the spectral radius and energy of a kind of weighted adjacency matrix of graphs

LU Peng-li, XUE Xiao-yan   

  1. School of Computer and Communication, Lanzhou Univ. of Tech., Lanzhou 730050, China
  • Received:2021-12-21 Online:2023-02-28 Published:2023-03-21

Abstract: A kind of weighted adjacency matrix of graph G is denoted by Adb(G)=(adbij)n×n, where $a_{i j}^{d b}=\frac{d_{i}+d_{j}}{d_{i} d_{j}}$ if the vertices vi and vj are adjacent, and adbij=0 otherwise. In this paper, some upper and lower bounds of the weighted spectral radius of graph G are first obtained, and then the Nordhaus-Gaddum-type relation for weighted spectral radius is given. In addition, several upper and lower bounds for the weighted energy are obtained, then, the Nordhaus-Gaddum-type results for the weighted energy are presented.

Key words: a kind of weighted adjacency matrix, weighted spectral radius, weighted energy, Nordhaus-Gaddum-type relation

CLC Number: