Some upper bounds for the signless Laplacian spectral radius of digraphs
Combinatorics
2016-10-26 v1
Abstract
Let be a digraph without loops and multiarcs, where and are the vertex set and the arc set of , respectively. Let be the outdegree of the vertex . Let be the adjacency matrix of and be the diagonal matrix with outdegrees of the vertices of . Then we call the signless Laplacian matrix of . The spectral radius of is called the signless Laplacian spectral radius of , denoted by . In this paper, some upper bounds for are obtained. Furthermore, some upper bounds on involving outdegrees and the average 2-outdegrees of the vertices of 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