The asymptotic number of spanning trees in circulant graphs-Reference-Cited by-同舟云学术

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

The asymptotic number of spanning trees in circulant graphs

Published:2010-02 Issue:4 Volume:310 Page:792-803
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Golin Mordecai J.,Yong Xuerong,Zhang Yuanping

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference19 articles.

1. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables;Abramowitz,1964

2. Tree counting polynomials for labelled graphs;Bedrosian;J. Franklin Inst.,1981

3. Algebraic Graph Theory;Biggs,1993

4. Spanning tree formulas and Chebyshev polynomials;Boesch;Graphs Combin.,1986

5. F.T. Boesch, J.F. Wang, A Conjecture on the number of spanning trees in the square of a cycle, in: Notes from New York Graph Theory Day V, 1982, page 16

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On two conjectures concerning spanning tree edge dependences of graphs;Discrete Applied Mathematics;2024-02

2. Counting rooted spanning forests for circulant foliation over a graph;Tohoku Mathematical Journal;2022-12-01

3. Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics;Ars Mathematica Contemporanea;2022-10-21

4. Complexity of the circulant foliation over a graph;Journal of Algebraic Combinatorics;2020-02-21

5. The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic;Discrete Mathematics;2019-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP