Abstract:The distance (signless) Laplacian eigenvalues of a connected hypergraph are the eigenvalues of its distance (signless) Laplacian matrix. For all n-vertex k-uniform hypertrees, we determine the k-uniform hypertree with minimum second largest distance (signless) Laplacian eigenvalue. For all n-vertex k-uniform unicyclic hypergraphs, we obtain the k-uniform unicyclic hypergraph with minimum largest distance (signless) Laplacian eigenvalue, and the k-uniform unicyclic hypergraph with minimum second largest distanc… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.