The maximum spectral radii of uniform supertrees with given degree sequences

Peng Xiao; Ligong Wang; Yong Lu

doi:10.1016/j.laa.2017.02.018

The maximum spectral radii of uniform supertrees with given degree sequences

Peng Xiao, Ligong Wang, Yong Lu

数学与统计学院

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

38 引用（Scopus）

摘要

This paper generalizes the breadth-first-search ordering on trees to k-uniform supertrees. By using 2-switch operation and edge-moving operation on supertrees, we determine the unique k-uniform supertree with the maximum spectral radius among all k-uniform supertrees with a given degree sequence. Moreover, we generalize the majorization theorem on trees to k-uniform supertrees.

源语言	英语
页（从-至）	33-45
页数	13
期刊	Linear Algebra and Its Applications
卷	523
DOI	https://doi.org/10.1016/j.laa.2017.02.018
出版状态	已出版 - 15 6月 2017

访问文件

10.1016/j.laa.2017.02.018

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{56877d93125f4cbaa674cc3aebaa678b,

title = "The maximum spectral radii of uniform supertrees with given degree sequences",

abstract = "This paper generalizes the breadth-first-search ordering on trees to k-uniform supertrees. By using 2-switch operation and edge-moving operation on supertrees, we determine the unique k-uniform supertree with the maximum spectral radius among all k-uniform supertrees with a given degree sequence. Moreover, we generalize the majorization theorem on trees to k-uniform supertrees.",

keywords = "Degree sequence, Majorization, Spectral radius, Supertree",

author = "Peng Xiao and Ligong Wang and Yong Lu",

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

year = "2017",

month = jun,

day = "15",

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

language = "英语",

volume = "523",

pages = "33--45",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - The maximum spectral radii of uniform supertrees with given degree sequences

AU - Xiao, Peng

AU - Wang, Ligong

AU - Lu, Yong

PY - 2017/6/15

Y1 - 2017/6/15

N2 - This paper generalizes the breadth-first-search ordering on trees to k-uniform supertrees. By using 2-switch operation and edge-moving operation on supertrees, we determine the unique k-uniform supertree with the maximum spectral radius among all k-uniform supertrees with a given degree sequence. Moreover, we generalize the majorization theorem on trees to k-uniform supertrees.

AB - This paper generalizes the breadth-first-search ordering on trees to k-uniform supertrees. By using 2-switch operation and edge-moving operation on supertrees, we determine the unique k-uniform supertree with the maximum spectral radius among all k-uniform supertrees with a given degree sequence. Moreover, we generalize the majorization theorem on trees to k-uniform supertrees.

KW - Degree sequence

KW - Majorization

KW - Spectral radius

KW - Supertree

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

U2 - 10.1016/j.laa.2017.02.018

DO - 10.1016/j.laa.2017.02.018

M3 - 文章

AN - SCOPUS:85013459760

SN - 0024-3795

VL - 523

SP - 33

EP - 45

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

ER -

The maximum spectral radii of uniform supertrees with given degree sequences

摘要

访问文件

其它文件与链接

指纹

引用此