检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:席维鸽 许涛 XI Wei-ge;XU Tao(College of Science,Northwest A&F University,Shaanxi 712100,China)
机构地区:[1]College of Science,Northwest A&F University,Shaanxi 712100,China
出 处:《Chinese Quarterly Journal of Mathematics》2024年第2期161-170,共10页数学季刊(英文版)
基 金:Supported by the National Natural Science Foundation of China (Grant No.12001434);The Natural Science Basic Research Program of Shaanxi Province (Grant No.2022JM-006);Chinese Universities Scientific Fund (Grant No.2452020021)
摘 要:Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix A_(α)(D),which is defined as Aα(D)=αW(D)+(1−α)A(D),0≤α≤1.The spectral radius of A_(α)(D)is called the Aαspectral radius of D,denoted byλα(D).We obtain some upper bounds on the Aαspectral radius of strongly connected irregular weighted digraphs.
关 键 词:Strongly connected Irregular weighted digraph A_(α)spectral radius Upper bounds
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7