English

Some upper bounds for the signless Laplacian spectral radius of digraphs

Combinatorics 2016-10-26 v1

Abstract

Let G=(V(G),E(G))G=(V(G) ,E(G)) be a digraph without loops and multiarcs, where V(G)={v1,v2,,vn}V(G)=\{v_1,v_2,\ldots,v_n\} and E(G)E(G) are the vertex set and the arc set of GG, respectively. Let di+d_i^{+} be the outdegree of the vertex viv_i. Let A(G)A(G) be the adjacency matrix of GG and D(G)=diag(d1+,d2+,,dn+)D(G)=\textrm{diag}(d_1^{+},d_2^{+},\ldots,d_n^{+}) be the diagonal matrix with outdegrees of the vertices of GG. Then we call Q(G)=D(G)+A(G)Q(G)=D(G)+A(G) the signless Laplacian matrix of GG. The spectral radius of Q(G)Q(G) is called the signless Laplacian spectral radius of GG, denoted by q(G)q(G). In this paper, some upper bounds for q(G)q(G) are obtained. Furthermore, some upper bounds on q(G)q(G) involving outdegrees and the average 2-outdegrees of the vertices of GG are also derived.

Keywords

Cite

@article{arxiv.1610.07888,
  title  = {Some upper bounds for the signless Laplacian spectral radius of digraphs},
  author = {Weige Xi and Ligong Wang},
  journal= {arXiv preprint arXiv:1610.07888},
  year   = {2016}
}

Comments

11pages, 2 figures, submitted