The distance spectral radius of digraphs

Authors:
Huiqiu Lin;Jinlong Shu
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 6
Cited 0

Matrix analysis

Matrix analysis
The distance spectrum of a tree

Journal of Graph Theory
Graph Theory With Applications

Graph Theory With Applications
Circular colorings of edge-weighted graphs

Journal of Graph Theory
The circular chromatic number of a digraph

Journal of Graph Theory
Distance spectral radius of trees with given matching number

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Let D(G@?) denote the distance matrix of a strongly connected digraph G@?. The eigenvalue of D(G@?) with the largest modulus is called the distance spectral radius of a digraph G@?, denoted by @r(G@?). 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.