当前位置:
X-MOL 学术
›
Discret. Optim.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
On the signless Laplacian spectral radius of weighted digraphs
Discrete Optimization ( IF 0.9 ) Pub Date : 2018-12-21 , DOI: 10.1016/j.disopt.2018.12.002 Weige Xi , Ligong Wang
中文翻译:
关于加权有向图的无符号拉普拉斯谱半径
更新日期:2018-12-21
Discrete Optimization ( IF 0.9 ) Pub Date : 2018-12-21 , DOI: 10.1016/j.disopt.2018.12.002 Weige Xi , Ligong Wang
Let be a weighted digraph with vertex set and arc set , where the arc weights are nonzero nonnegative symmetric matrices. In this paper, we obtain an upper bound on the signless Laplacian spectral radius of a weighted digraph , and if is strongly connected, we also characterize the digraphs achieving the upper bound. Moreover, we show that an upper bound of weighted digraphs or unweighted digraphs can be deduced from our upper bound.
中文翻译:
关于加权有向图的无符号拉普拉斯谱半径
让 是带有顶点集的加权有向图 和弧集 ,其中弧权重为非零非负对称矩阵。在本文中,我们获得了加权有向图的无符号拉普拉斯谱半径的上限, 而如果 是紧密相连的,我们还描述了有向图达到上限的图。此外,我们表明可以从我们的上限推导加权图或未加权图的上限。