On the signless Laplacian spectral radius of weighted digraphs

Weige Xi, Ligong Wang

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)63-72
Number of pages10
JournalDiscrete Optimization
Volume32
DOIs
StatePublished - May 2019

Keywords

  • Signless Laplacian spectral radius
  • Upper bound
  • Weighted digraph

Fingerprint

Dive into the research topics of 'On the signless Laplacian spectral radius of weighted digraphs'. Together they form a unique fingerprint.

Cite this