| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646824 | Discrete Mathematics | 2016 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Stephen Drury, Huiqiu Lin,