Distance (Signless) Laplacian Eigenvalues of $k$-uniform Hypergraphs
Taiwanese Journal of Mathematics · 21.11.2022 · 26 (6) · 1093-1111
DOI: 10.11650/tjm/220604 ↗Kurz gefasst
Fachartikel in der Zeitschrift Taiwanese Journal of Mathematics, erschienen am 21.11.2022. Verfasst von Xiangxiang Liu und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 24 Literaturangaben.
Abstract (Originalsprache)
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 distance Laplacian eigenvalue.
Zitieren
APA
Liu, X., & Wang, L. (2022). Distance (Signless) Laplacian Eigenvalues of $k$-uniform Hypergraphs. Taiwanese Journal of Mathematics, 26(6), 1093-1111. https://doi.org/10.11650/tjm/220604
Vancouver
Liu X, Wang L. Distance (Signless) Laplacian Eigenvalues of $k$-uniform Hypergraphs. Taiwanese Journal of Mathematics. 2022;26(6):1093-1111. doi:10.11650/tjm/220604
BibTeX
@article{Liu2022,
author = {Liu, Xiangxiang and Wang, Ligong},
title = {Distance (Signless) Laplacian Eigenvalues of $k$-uniform Hypergraphs},
journal = {Taiwanese Journal of Mathematics},
year = {2022},
volume = {26},
number = {6},
pages = {1093--1111},
doi = {10.11650/tjm/220604}
}
EUVIMED