文献类型：期刊文献

英文题名：The distance spectral radius of digraphs

作者：Lin, Huiqiu[1];Shu, Jinlong[2]

机构：[1]E China Univ Sci & Technol, Sch Sci, Dept Math, Shanghai 200237, Peoples R China;[2]E China Normal Univ, Dept Math, Shanghai 200062, Peoples R China

年份：2013

卷号：161

期号：16-17

起止页码：2537

外文期刊名：DISCRETE APPLIED MATHEMATICS

收录：;EI(收录号：20133916770844);WOS:【SCI-EXPANDED(收录号:WOS:000325663900020)】；

基金：Supported by NSFC (No. 11075057, No. 11071078 and No. 11271315).

语种：英文

外文关键词：Distance spectral radius; Distance regular; Dichromatic number; Arc connectivity

摘要：Let D((G) over right arrow) denote the distance matrix of a strongly connected digraph (G) over right arrow. The eigenvalue of D((G) over right arrow) with the largest modulus is called the distance spectral radius of a digraph (G) over right arrow, denoted by rho((G) over right arrow). In this paper, we first give sharp upper and lower bounds for the distance spectral radius for strongly connected digraphs; we then characterize the digraphs having the maximal and minimal distance spectral radii among all strongly connected digraphs; we also determine the extremal digraph with the minimal distance spectral radius with given arc connectivity and the extremal digraph with the minimal distance spectral radius with given dichromatic number. (C) 2013 Elsevier B.V. All rights reserved.