The first two largest spectral radii of uniform supertrees with given diameter

Peng Xiao; Ligong Wang; Yanfei Du

doi:10.1016/j.laa.2017.09.009

The first two largest spectral radii of uniform supertrees with given diameter

Peng Xiao
, Ligong Wang
, Yanfei Du

数学与统计学院

Northwestern Polytechnical University Xian
Shaanxi University of Science and Technology

科研成果: 期刊稿件 › 文章 › 同行评审

25 引用（Scopus）

摘要

A supertree is a connected and acyclic hypergraph. Let S(m,d,k) be the set of k-uniform supertrees with m edges and diameter d. In this paper, we determine the supertrees with the first two largest spectral radii among all supertrees in S(m,d,k) for 3≤d≤m−1.

源语言	英语
页（从-至）	103-119
页数	17
期刊	Linear Algebra and Its Applications
卷	536
DOI	https://doi.org/10.1016/j.laa.2017.09.009
出版状态	已出版 - 1 1月 2018

访问文件

10.1016/j.laa.2017.09.009

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{253157be0fbc437e8f144fff4a24c053,

title = "The first two largest spectral radii of uniform supertrees with given diameter",

abstract = "A supertree is a connected and acyclic hypergraph. Let S(m,d,k) be the set of k-uniform supertrees with m edges and diameter d. In this paper, we determine the supertrees with the first two largest spectral radii among all supertrees in S(m,d,k) for 3≤d≤m−1.",

keywords = "Diameter, Hypergraph, Spectral radius, Supertree",

author = "Peng Xiao and Ligong Wang and Yanfei Du",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier Inc.",

year = "2018",

month = jan,

day = "1",

doi = "10.1016/j.laa.2017.09.009",

language = "英语",

volume = "536",

pages = "103--119",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - The first two largest spectral radii of uniform supertrees with given diameter

AU - Xiao, Peng

AU - Wang, Ligong

AU - Du, Yanfei

PY - 2018/1/1

Y1 - 2018/1/1

N2 - A supertree is a connected and acyclic hypergraph. Let S(m,d,k) be the set of k-uniform supertrees with m edges and diameter d. In this paper, we determine the supertrees with the first two largest spectral radii among all supertrees in S(m,d,k) for 3≤d≤m−1.

AB - A supertree is a connected and acyclic hypergraph. Let S(m,d,k) be the set of k-uniform supertrees with m edges and diameter d. In this paper, we determine the supertrees with the first two largest spectral radii among all supertrees in S(m,d,k) for 3≤d≤m−1.

KW - Diameter

KW - Hypergraph

KW - Spectral radius

KW - Supertree

UR - https://www.scopus.com/pages/publications/85029651303

U2 - 10.1016/j.laa.2017.09.009

DO - 10.1016/j.laa.2017.09.009

M3 - 文章

AN - SCOPUS:85029651303

SN - 0024-3795

VL - 536

SP - 103

EP - 119

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

ER -

The first two largest spectral radii of uniform supertrees with given diameter

摘要

访问文件

其它文件与链接

学术指纹

引用此