Graph functions maximized on a path

DOI10.1016/j.laa.2015.07.012zbMath1322.05083arXiv1412.8215OpenAlexW2963551218MaRDI QIDQ745175

D. Kharzeev

Publication date: 13 October 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

pathlargest eigenvaluedistance matrixdistance Laplaciandistance signless Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Distance in graphs (05C12) Connectivity (05C40)

Related Items (9)

Distance (signless) Laplacian spectral radius of uniform hypergraphs ⋮ Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph ⋮ On the distance Laplacian spectral radius of bicyclic graphs ⋮ The generalized distance matrix ⋮ On the multiplicity of distance signless Laplacian eigenvalues of graphs ⋮ On the first two largest distance Laplacian eigenvalues of unicyclic graphs ⋮ The changes in distance Laplacian spectral radius of graphs resulting from graft transformations ⋮ Extremal results on distance Laplacian spectral radius of graphs ⋮ On the D_α-spectra of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Two Laplacians for the distance matrix of a graph
• On the distance Laplacian spectra of graphs
• Properties of spectra of graphs and line graphs
• On the eigenvalues of trees
• On the distance signless Laplacian spectral radius of graphs
• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• Distance spectral radius of trees with fixed maximum degree
• Some properties of the distance Laplacian eigenvalues of a graph

This page was built for publication: Graph functions maximized on a path