Some upper bounds for the signless laplacian spectral radius of digraphs

Weige Xi, Ligong Wang

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Let G = (V(G), E(G) be a digraph without loops and multiarcs, where V(G) = (v1, v2,..., vn) and E(G) are the vertex set and the arc set of G, respectively. Let be the outdegree of the vertex vi. Let A(G) be the adjacency matrix of G and D(G) = diag be the diagonal matrix with outdegrees of the vertices of G. Then we call Q(G) = D(G) +-4(G) the signless Laplacian matrix of G. The spectral radius of Q(G) is called the signless Laplacian spectral radius of G. denoted by q(G). In this paper, some upper bounds for q(G) are obtained. Furthermore, some upper bounds on q(G) involving outdegrees and the average 2-outdegrees of the vertices of G are also derived.

Original languageEnglish
Pages (from-to)49-60
Number of pages12
JournalTransactions on Combinatorics
Volume8
Issue number4
DOIs
StatePublished - 1 Dec 2019

Keywords

  • Digraph
  • Signless laplacian spectral radius
  • Upper bounds

Fingerprint

Dive into the research topics of 'Some upper bounds for the signless laplacian spectral radius of digraphs'. Together they form a unique fingerprint.

Cite this