文献类型：期刊文献

英文题名：Colorings and spectral radius of digraphs

作者：Drury, Stephen[1];Lin, Huiqiu[2]

机构：[1]McGill Univ, Dept Math & Stat, Montreal, PQ H3A 0B9, Canada;[2]E China Univ Sci & Technol, Sch Sci, Dept Math, Shanghai 200237, Peoples R China

年份：2016

卷号：339

期号：1

起止页码：327

外文期刊名：DISCRETE MATHEMATICS

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000364265000035)】；

基金：The second author is supported by the National Natural Science Foundation of China (Nos. 11401211 and 11471121), the China Postdoctoral Science Foundation (No. 2014M560303) and Fundamental Research Funds for the Central Universities (No. 222201414021).

语种：英文

外文关键词：Digraph; Strongly connected; Dichromatic number; Spectral radius

摘要：We determine the digraphs that have the minimum and second minimum spectral radius among all strongly connected digraphs with given order and dichromatic number. This solves a problem posed by Lin, Shu, Wu, and Yu. (C) 2015 Elsevier B.V. All rights reserved.