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

Abstract

Determine the graphs whose smallest distance signless Laplacian eigenvalue has multiplicity n-2.

Publication
In Linear and Multilinear Algebra
Click the Cite button above to demo the feature to enable visitors to import publication metadata into their reference management software.
Create your slides in Markdown - click the Slides button to check out the example.

Supplementary notes can be added here, including code, math, and images.

Lu Lu(鲁卢)
Lu Lu(鲁卢)
Associate Professor, PhD Supervisor

My research interests include algebraic graph theory, spectral graph theory and group theory.