pith. sign in

arxiv: 1308.3427 · v1 · pith:UWVXDICHnew · submitted 2013-08-15 · 🧮 math.CO

Some sharp bounds on the distance signless Laplacian spectral radius of graphs

classification 🧮 math.CO
keywords laplaciandistancesignlessradiussharpspectralboundsgraph
0
0 comments X
read the original abstract

M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the sharp upper bounds of the spectral radius of a nonnegative matrix, then apply these theorems to signless Laplacian matrices and the distance signless Laplacian matrices to obtain some sharp bounds on the spectral radius, respectively. We also proposed a known result about the sharp bound of the signless Laplacian spectral radius has a defect.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.