Distance spectral radii of k-uniform hypertrees with fixed diameter

Xiangxiang Liu; Ligong Wang

doi:10.1007/s10801-024-01316-z

Distance spectral radii of k-uniform hypertrees with fixed diameter

Xiangxiang Liu, Ligong Wang

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

Abstract

The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we determine the k-uniform hypertree with the minimal spectral radius among all k-uniform hypertrees with m edges and diameter d, where 3≤d≤m-1.

Original language	English
Pages (from-to)	899-915
Number of pages	17
Journal	Journal of Algebraic Combinatorics
Volume	59
Issue number	4
DOIs	https://doi.org/10.1007/s10801-024-01316-z
State	Published - Jun 2024

Keywords

Diameter
Distance spectral radius
k-uniform hypertree

Access to Document

10.1007/s10801-024-01316-z

Cite this

@article{0c3c13af7fa94033895a801f56a125c4,

title = "Distance spectral radii of k-uniform hypertrees with fixed diameter",

abstract = "The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we determine the k-uniform hypertree with the minimal spectral radius among all k-uniform hypertrees with m edges and diameter d, where 3≤d≤m-1.",

keywords = "Diameter, Distance spectral radius, k-uniform hypertree",

author = "Xiangxiang Liu and Ligong Wang",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.",

year = "2024",

month = jun,

doi = "10.1007/s10801-024-01316-z",

language = "英语",

volume = "59",

pages = "899--915",

journal = "Journal of Algebraic Combinatorics",

issn = "0925-9899",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - Distance spectral radii of k-uniform hypertrees with fixed diameter

AU - Liu, Xiangxiang

AU - Wang, Ligong

N1 - Publisher Copyright: © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

PY - 2024/6

Y1 - 2024/6

N2 - The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we determine the k-uniform hypertree with the minimal spectral radius among all k-uniform hypertrees with m edges and diameter d, where 3≤d≤m-1.

AB - The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we determine the k-uniform hypertree with the minimal spectral radius among all k-uniform hypertrees with m edges and diameter d, where 3≤d≤m-1.

KW - Diameter

KW - Distance spectral radius

KW - k-uniform hypertree

UR - http://www.scopus.com/inward/record.url?scp=85189372334&partnerID=8YFLogxK

U2 - 10.1007/s10801-024-01316-z

DO - 10.1007/s10801-024-01316-z

M3 - 文章

AN - SCOPUS:85189372334

SN - 0925-9899

VL - 59

SP - 899

EP - 915

JO - Journal of Algebraic Combinatorics

JF - Journal of Algebraic Combinatorics

IS - 4

ER -

Distance spectral radii of k-uniform hypertrees with fixed diameter

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this