Papers
Topics
Authors
Recent
Search
2000 character limit reached

Some upper bounds for the signless Laplacian spectral radius of digraphs

Published 25 Oct 2016 in math.CO | (1610.07888v1)

Abstract: Let $G=(V(G) ,E(G))$ be a digraph without loops and multiarcs, where $V(G)={v_1,v_2,\ldots,v_n}$ and $E(G)$ are the vertex set and the arc set of $G$, respectively. Let $d_i{+}$ be the outdegree of the vertex $v_i$. Let $A(G)$ be the adjacency matrix of $G$ and $D(G)=\textrm{diag}(d_1{+},d_2{+},\ldots,d_n{+})$ be the diagonal matrix with outdegrees of the vertices of $G$. Then we call $Q(G)=D(G)+A(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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.