Maximum Modulus of Independence Roots of Graphs and Trees

Jason I. Brown; Ben Cameron

doi:10.1007/s00373-020-02160-1

Maximum Modulus of Independence Roots of Graphs and Trees

Jason I. Brown, Ben Cameron

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

源语言	英语
页（从-至）	877-894
页数	18
期刊	Graphs and Combinatorics
卷	36
期	3
DOI	https://doi.org/10.1007/s00373-020-02160-1
出版状态	已出版 - 5月 1 2020
已对外发布	是

!!!ASJC Scopus Subject Areas

理论计算机科学
离散数学和组合学

访问文件

10.1007/s00373-020-02160-1

其它文件与链接

引用此

@article{fab4f447595948acb6c02d3f192bb515,

title = "Maximum Modulus of Independence Roots of Graphs and Trees",

keywords = "Graph, Independence polynomial, Maximum modulus, Root",

author = "Brown, {Jason I.} and Ben Cameron",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Japan KK, part of Springer Nature.",

year = "2020",

month = may,

day = "1",

doi = "10.1007/s00373-020-02160-1",

language = "English",

volume = "36",

pages = "877--894",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "3",

}

TY - JOUR

T1 - Maximum Modulus of Independence Roots of Graphs and Trees

AU - Brown, Jason I.

AU - Cameron, Ben

PY - 2020/5/1

Y1 - 2020/5/1

KW - Graph

KW - Independence polynomial

KW - Maximum modulus

KW - Root

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

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

U2 - 10.1007/s00373-020-02160-1

DO - 10.1007/s00373-020-02160-1

M3 - Article

AN - SCOPUS:85082756363

SN - 0911-0119

VL - 36

SP - 877

EP - 894

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 3

ER -

Maximum Modulus of Independence Roots of Graphs and Trees

!!!ASJC Scopus Subject Areas

访问文件

其它文件与链接

指纹

引用此