Affordable Access

Publisher Website

The distance spectral radius of digraphs

Authors
Journal
Discrete Applied Mathematics
0166-218X
Publisher
Elsevier
Volume
161
Identifiers
DOI: 10.1016/j.dam.2013.04.011
Keywords
  • Distance Spectral Radius
  • Distance Regular
  • Dichromatic Number
  • Arc Connectivity

Abstract

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 ϱ(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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Distance spectral radius of digraphs with given co...

on Discrete Mathematics Jun 06, 2012

Sharp bounds for the spectral radius of digraphs

on Linear Algebra and its Applica... Jan 01, 2009

Spectral radius of strongly connected digraphs

on Discrete Mathematics Dec 28, 2012
More articles like this..