Article ID Journal Published Year Pages File Type
4949544 Discrete Applied Mathematics 2017 6 Pages PDF
Abstract
Let q(G) and μ(G) denote the signless Laplacian and distance signless Laplacian spectral radius of a digraph G, respectively. In this paper, we characterize the extremal digraph which has the maximum signless Laplacian spectral radius among all strongly connected digraphs with given dichromatic number. We also determine the extremal digraph having the minimum distance signless Laplacian spectral radius among all strongly connected digraphs with given vertex connectivity.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,