Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs

Published:2017-01 Issue:2 Volume:31 Page:1196-1216
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Helmberg Christoph,Rocha Israel,Schwerdtfeger Uwe

Funder

Coordenação de AperfeiÇoamento de Pessoal de Nível Superior

Deutscher Akademischer Austauschdienst

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics

Link

https://epubs.siam.org/doi/pdf/10.1137/15M1034854

Reference18 articles.

1. Fastest Mixing Markov Chain on a Graph

2. Towards a spectral theory of graphs based on the signless Laplacian, I

3. Towards a spectral theory of graphs based on the signless Laplacian, II

4. Towards a spectral theory of graphs based on the signless Laplacian, III

5. A characterization of the smallest eigenvalue of a graph

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP