On the spectral radius of simple digraphs with prescribed number of arcs

被引：5
|
作者：
Jin, Ya-Lei
Zhang, Xiao-Dong [1 ]
机构：
[1] Shanghai Jiao Tong Univ, Dept Math, Shanghai 200240, Peoples R China
来源：
DISCRETE MATHEMATICS | 2015年 / 338卷 / 09期
基金：
中国国家自然科学基金;
关键词：
Simple digraph; Spectral radius; Arc; NONNEGATIVE MATRICES;
D O I：
10.1016/j.disc.2015.03.020
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper presents a sharp upper bound for the spectral radius of simple digraphs with described number of arcs. Further, the extremal graphs which attain the maximum spectral radius among all simple digraphs with fixed arcs are investigated. In particular, we characterize all extremal simple digraphs with the maximum spectral radius among all simple digraphs with arcs number e = 2 ((k)(2)) + t and k> 4t(4) + 4. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：1555 / 1564
页数：10
相关论文
共 50 条
12345