Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs

Let G = (V (G),E(G)) be a simple strongly connected digraph and q(G) be the signless Laplacian spectral radius of G. For any vertex vi ∈ V (G), let d+i denote the outdegree of vi, m+i denote the average 2-outdegree of vi, and N+i denote the set of out-neighbors of vi. In this paper, we prove that:

Bibliographic Details
Main Authors: Xi Weige, Wang Ligong
Format: Article
Language:English
Published: Sciendo 2016-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1915