Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs

Dan Li, Guoping Wang and Jixiang Meng

Applied Mathematics and Computation, 2017, vol. 293, issue C, 218-225

Abstract: Let ρ(D(G)) denote the distance spectral radius of a graph G and ∂(G→) denote the distance signless Laplacian spectral radius of a digraph G→. Let Gn,kD be the set of all k-connected graphs of order n with diameter D. In this paper, we first determine the unique graph with minimum distance spectral radius in Gn,kD; we then give sharp upper and lower bounds for the distance signless Laplacian spectral radius of strongly connected digraphs; we also characterize the digraphs having the maximal and minimal distance signless Laplacian spectral radii among all strongly connected digraphs; furthermore, we determine the extremal digraph with the minimal distance signless Laplacian spectral radius with given dichromatic number.

Keywords: Distance matrix; Distance signless Laplacian matrix; Dichromatic number; Spectral radius (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316305203
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:293:y:2017:i:c:p:218-225

DOI: 10.1016/j.amc.2016.08.025

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().