TY - JOUR
T1 - On the signless Laplacian spectral radius of weighted digraphs
AU - Xi, Weige
AU - Wang, Ligong
N1 - Publisher Copyright:
© 2018 Elsevier B.V.
PY - 2019/5
Y1 - 2019/5
N2 - Let G=(V(G),E(G)) be a weighted digraph with vertex set V(G)={v 1 ,v 2 ,…,v n } and arc set E(G), 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 G, and if G 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.
AB - Let G=(V(G),E(G)) be a weighted digraph with vertex set V(G)={v 1 ,v 2 ,…,v n } and arc set E(G), 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 G, and if G 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.
KW - Signless Laplacian spectral radius
KW - Upper bound
KW - Weighted digraph
UR - https://www.scopus.com/pages/publications/85058700416
U2 - 10.1016/j.disopt.2018.12.002
DO - 10.1016/j.disopt.2018.12.002
M3 - 文章
AN - SCOPUS:85058700416
SN - 1572-5286
VL - 32
SP - 63
EP - 72
JO - Discrete Optimization
JF - Discrete Optimization
ER -