Ordering of k-uniform hypertrees by their distance spectral radii
Filomat, Tome 36 (2022) no. 9, p. 3025
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper we present a new transformation that decreases distance spectral radius. As applications , if ∆ ≥ ⌈ m+1 2 ⌉, we determine the unique k-uniform hypertree of fixed m edges and maximum degree ∆ with the minimum distance spectral radius. And we characterize the k-uniform hypertrees on m edges with the fourth, fifth, and sixth smallest distance spectral radius. In addition, we obtain the k-uniform hypertree on m edges with the third largest distance spectral radius.
Classification :
05C50, 05C65
Keywords: Distance matrix, Distance spectral radius, k-uniform hypertree
Keywords: Distance matrix, Distance spectral radius, k-uniform hypertree
Xiangxiang Liu; Ligong Wang; Xihe Li. Ordering of k-uniform hypertrees by their distance spectral radii. Filomat, Tome 36 (2022) no. 9, p. 3025 . doi: 10.2298/FIL2209025L
@article{10_2298_FIL2209025L,
author = {Xiangxiang Liu and Ligong Wang and Xihe Li},
title = {Ordering of k-uniform hypertrees by their distance spectral radii},
journal = {Filomat},
pages = {3025 },
year = {2022},
volume = {36},
number = {9},
doi = {10.2298/FIL2209025L},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2209025L/}
}
TY - JOUR AU - Xiangxiang Liu AU - Ligong Wang AU - Xihe Li TI - Ordering of k-uniform hypertrees by their distance spectral radii JO - Filomat PY - 2022 SP - 3025 VL - 36 IS - 9 UR - http://geodesic.mathdoc.fr/articles/10.2298/FIL2209025L/ DO - 10.2298/FIL2209025L LA - en ID - 10_2298_FIL2209025L ER -
Cité par Sources :