•
•

#### Keywords

Distance signless Laplacian spectral radius; Bound; Extremal graph; Digraph;Vertex connectivity

#### Abstract

Let \eta(G) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper,bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless Laplacian spectral radius among the graphs with given vertex connectivity and minimum degree is determined. Furthermore, the digraph that minimizes the distance signless Laplacian spectral radius with given vertex connectivity is characterized.

abs_vol32_pp438-446.pdf (98 kB)
Abstract (PDF)

COinS