Distance spectral radii of k-uniform hypertrees with given parameters

Xiangxiang Liu; Ligong Wang; Xihe Li

doi:10.1080/03081087.2019.1682497

Distance spectral radii of k-uniform hypertrees with given parameters

Xiangxiang Liu, Ligong Wang, Xihe Li

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

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

4 Scopus citations

Abstract

The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we obtain the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and matching number r. We also characterize the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and independence number α.

Original language	English
Pages (from-to)	2558-2571
Number of pages	14
Journal	Linear and Multilinear Algebra
Volume	69
Issue number	14
DOIs	https://doi.org/10.1080/03081087.2019.1682497
State	Published - 2021

Keywords

05C50
05C65
Distance spectral radius
independence number
k-uniform hypertree
matching number

Access to Document

10.1080/03081087.2019.1682497

Cite this

@article{194dea446c0145a5a8de77e784b58688,

title = "Distance spectral radii of k-uniform hypertrees with given parameters",

abstract = "The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we obtain the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and matching number r. We also characterize the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and independence number α.",

keywords = "05C50, 05C65, Distance spectral radius, independence number, k-uniform hypertree, matching number",

author = "Xiangxiang Liu and Ligong Wang and Xihe Li",

note = "Publisher Copyright: {\textcopyright} 2019 Informa UK Limited, trading as Taylor & Francis Group.",

year = "2021",

doi = "10.1080/03081087.2019.1682497",

language = "英语",

volume = "69",

pages = "2558--2571",

journal = "Linear and Multilinear Algebra",

issn = "0308-1087",

publisher = "Taylor and Francis Ltd.",

number = "14",

}

TY - JOUR

T1 - Distance spectral radii of k-uniform hypertrees with given parameters

AU - Liu, Xiangxiang

AU - Wang, Ligong

AU - Li, Xihe

PY - 2021

Y1 - 2021

N2 - The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we obtain the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and matching number r. We also characterize the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and independence number α.

AB - The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we obtain the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and matching number r. We also characterize the k-uniform hypertree with minimum distance spectral radius among all k-uniform hypertrees with n vertices and independence number α.

KW - 05C50

KW - 05C65

KW - Distance spectral radius

KW - independence number

KW - k-uniform hypertree

KW - matching number

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

U2 - 10.1080/03081087.2019.1682497

DO - 10.1080/03081087.2019.1682497

M3 - 文章

AN - SCOPUS:85075577210

SN - 0308-1087

VL - 69

SP - 2558

EP - 2571

JO - Linear and Multilinear Algebra

JF - Linear and Multilinear Algebra

IS - 14

ER -

Distance spectral radii of k-uniform hypertrees with given parameters

Abstract

Keywords

Access to Document

Other files and links

Cite this