New bounds on the distance Laplacian and distance signless Laplacian spectral radii

DOI10.22199/ISSN.0717-6279-2019-04-0056zbMATH Open1451.05138arXiv1804.06335OpenAlexW2981478671MaRDI QIDQ5142111FDOQ5142111

Authors: Roberto C. Díaz, Ana I. Julio, Oscar Rojo 

Publication date: 29 December 2020

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Abstract: Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are derived. Some of the above mentioned bounds are sharp and the graphs attaining the corresponding bound are characterized. Several illustrative examples are included.

Full work available at URL: https://arxiv.org/abs/1804.06335

Recommendations

• New bounds and extremal graphs for distance signless Laplacian spectral radius
• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• On the distance and distance signless Laplacian eigenvalues of graphs and the smallest Geršgorin disc
• On the distance signless Laplacian spectral radius of graphs and digraphs
• On the distance signless Laplacian spectral radius and the distance signless Laplacian energy of graphs

zbMATH Keywords

spectral radiusdistance matrixdistance signless Laplacian matrixWiener indexdistance Laplacian matrixvertex transmission

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Cites Work

• Matrix Analysis
• A note on the metric properties of trees
• A note on the tree realizability of a distance matrix
• Distance spectra of graphs: a survey
• On the Addressing Problem for Loop Switching
• Two Laplacians for the distance matrix of a graph
• On a conjecture about the Szeged index
• Trees related to realizations of distance matrices
• On the least distance eigenvalue of a graph
• Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
• On the distance signless Laplacian of a graph
• On the Laplacian spectral radius of a graph
• On the distance spectrum of graphs
• Distance matrix of a graph and its realizability
• On spectral radius of the distance matrix
• Some properties of the distance Laplacian eigenvalues of a graph.
• Upper bound for the Laplacian graph eigenvalues
• A sharp upper bound for the spectral radius of a nonnegative matrix and applications.
• Properties of the distance matrix of a tree
• Abschätzungen für die Eigenwerte positiver linearer Operatoren
• An algorithm and its role in the study of optimal graph realizations of distance matrices
• A note on distance matrices with unicyclic graph realizations
• Title not available (Why is that?)
• A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph.

Cited In (8)

• Bounds for the extreme eigenvalues of the Laplacian and signless Laplacian of a graph
• Sharp upper bounds on the distance energies of a graph
• Upper bounds and lower bounds for the spectral radius of reciprocal distance, reciprocal distance Laplacian and reciprocal distance signless Laplacian matrices
• The effect of graft transformations on distance signless Laplacian spectral radius
• New bounds and extremal graphs for distance signless Laplacian spectral radius
• On the distance and distance signless Laplacian eigenvalues of graphs and the smallest Geršgorin disc
• Distance Laplacian spectra of graphs: a survey
• New bounds for the spread of the signless Laplacian spectrum

This page was built for publication: New bounds on the distance Laplacian and distance signless Laplacian spectral radii

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142111)