兰州理工大学学报 ›› 2023, Vol. 49 ›› Issue (1): 144-151.

• 数理科学 • 上一篇    下一篇

图的一种加权邻接矩阵谱半径和能量的界

卢鹏丽*, 薛小燕   

  1. 兰州理工大学 计算机与通信学院, 甘肃 兰州 730050
  • 收稿日期:2021-12-21 出版日期:2023-02-28 发布日期:2023-03-21
  • 通讯作者: 卢鹏丽(1973-),女,甘肃酒泉人,教授,博导. Email:lupengli88@163.com
  • 基金资助:
    国家自然科学基金(11361033,11861045,62162040)

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

摘要: 图G的一种加权邻接矩阵记为Adb(G)=(adbij)n×n,若顶点vi和顶点vj相邻,则$a_{i j}^{d b}=\frac{d_{i}+d_{j}}{d_{i} d_{j}}$, 反之adbij=0.给出图G的加权谱半径的上下界,并在此基础上给出加权谱半径的Nordhaus-Gaddum-type关系.得到了图G的加权能量的几个上下界,并在此基础上给出加权能量的Nordhaus-Gaddum-type关系.

关键词: 一种加权邻接矩阵, 加权谱半径, 加权能量, Nordhaus-Gaddum-type关系

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

中图分类号: