On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity

DOI10.1080/03081087.2017.1391166zbMath1401.05187OpenAlexW2766905430MaRDI QIDQ4685514

Xueyi Huang, Lu Lu, Qiong Xiang Huang

Publication date: 9 October 2018

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

Full work available at URL: https://doi.org/10.1080/03081087.2017.1391166

zbMATH Keywords

smallest eigenvaluedistance matrixdistance signless Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Related Items (9)

On the smallest eigenvalue of D_α-matrix of connected graphs ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ Unnamed Item ⋮ Sharp bounds for spectral radius of Dα-matrix of graphs ⋮ The closeness eigenvalues of graphs ⋮ On the sum of the powers of distance signless Laplacian eigenvalues of graphs ⋮ Matching number, connectivity and eigenvalues of distance signless Laplacians ⋮ Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector

Cites Work

• Unnamed Item
• Hypercubes are determined by their distance spectra
• On regular graphs with four distinct eigenvalues
• Two Laplacians for the distance matrix of a graph
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
• Complement reducible graphs
• Multiplicative cones - a family of three eigenvalue graphs
• Nonregular graphs with three eigenvalues
• On graphs with three eigenvalues
• Small regular graphs with four eigenvalues
• A nonregular analogue of conference graphs
• Regular graphs with four eigenvalues
• On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
• Distance spectra of graphs: a survey
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• A note on a conjecture for the distance Laplacian matrix
• On the distance and distance Laplacian eigenvalues of graphs

This page was built for publication: On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity