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

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) 2133]. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…