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

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 G n , k D 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 G n , k D ; 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.

[1]  Huiqiu Lin.  On the least distance eigenvalue and its applications on the distance spread , 2015, Discret. Math..

[2]  Hailiang Zhang,et al.  Distance spectral radius of digraphs with given connectivity , 2012, Discret. Math..

[3]  Ivan Gutman,et al.  ON THE STRUCTURE-DEPENDENCE OF THE LARGEST EIGENVALUE OF THE DISTANCE MATRIX OF AN ALKANE , 1998 .

[4]  P. Hansen,et al.  Two Laplacians for the distance matrix of a graph , 2011 .

[6]  O. Ore.  Diameters in graphs , 1968 .

[7]  Huiqiu Lin,et al.  The distance spectral radius of digraphs , 2013, Discret. Appl. Math..

[8]  Wai Chee Shiu,et al.  Maximizing the spectral radius of k-connected graphs with given diameter ☆ , 2016 .

[9]  Characterization of extremal graphs from distance signless Laplacian eigenvalues , 2016 .

[10]  Huiqiu Lin,et al.  On the distance spectrum of graphs , 2013 .

[11]  Xiwen Lu,et al.  Bounds on the distance signless Laplacian spectral radius in terms of clique number , 2015 .

[12]  Pierre Hansen,et al.  On bags and bugs , 2005, Discret. Appl. Math..

[13]  Xiaoling Zhang,et al.  Connectivity and minimal distance spectral radius of graphs , 2010 .

[14]  Alexandru T. Balaban,et al.  Topological indices and real number vertex invariants based on graph eigenvalues or eigenvectors , 1991, J. Chem. Inf. Comput. Sci..

[15]  Xiwen Lu,et al.  The inertia and energy of the distance matrix of a connected graph , 2015 .

[16]  Jixiang Meng,et al.  The graphs with the least distance eigenvalue at least −1+172☆ , 2016 .

[17]  Xiaoling Zhang.  On the distance spectral radius of some graphs , 2012 .

[18]  Shi-Cai Gong,et al.  On graphs with at least three distance eigenvalues less than −1☆ , 2014 .