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:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1915 |
id |
doaj-b804c2ddad09499b9910ae7035c273c8 |
---|---|
record_format |
Article |
spelling |
doaj-b804c2ddad09499b9910ae7035c273c82021-09-05T17:20:22ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922016-11-0136497798810.7151/dmgt.1915dmgt.1915Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected DigraphsXi Weige0Wang Ligong1Department of Applied Mathematics School of Science, Northwestern Polytechnical University Xi’an, Shaanxi 710072, P.R., ChinaDepartment of Applied Mathematics School of Science, Northwestern Polytechnical University Xi’an, Shaanxi 710072, P.R., ChinaLet 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:https://doi.org/10.7151/dmgt.1915digraphsignless laplacian spectral radius |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Xi Weige Wang Ligong |
spellingShingle |
Xi Weige Wang Ligong Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs Discussiones Mathematicae Graph Theory digraph signless laplacian spectral radius |
author_facet |
Xi Weige Wang Ligong |
author_sort |
Xi Weige |
title |
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs |
title_short |
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs |
title_full |
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs |
title_fullStr |
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs |
title_full_unstemmed |
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs |
title_sort |
sharp upper bounds on the signless laplacian spectral radius of strongly connected digraphs |
publisher |
Sciendo |
series |
Discussiones Mathematicae Graph Theory |
issn |
2083-5892 |
publishDate |
2016-11-01 |
description |
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: |
topic |
digraph signless laplacian spectral radius |
url |
https://doi.org/10.7151/dmgt.1915 |
work_keys_str_mv |
AT xiweige sharpupperboundsonthesignlesslaplacianspectralradiusofstronglyconnecteddigraphs AT wangligong sharpupperboundsonthesignlesslaplacianspectralradiusofstronglyconnecteddigraphs |
_version_ |
1717786466132688896 |