Asymptotically large <mml:math altimg="si24.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>,</mml:mo><mml:mi>D</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-graphs-Reference-Cited by-同舟云学术

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

Asymptotically large (Δ,D)-graphs

Published:2005-11 Issue:1-3 Volume:152 Page:89-108
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Canale Eduardo A.,Gómez José

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference16 articles.

1. Large graphs with given degree and diameter;Bermond;J. Comb. Theory B,1984

2. Strategies for interconnection networks: Some methods from graph theory;Bermond;J. Parallel and Distributed Process.,1986

3. Extremal Graph Theory;Bollobás,1978

4. The diameter of random regular graphs;Bollobás;Combinatorica,1982

5. J. Bond, Graphs on alphabets, Technical Report 385, Université de Paris Sud, Centre d’Orsay, Lab. de Recherche en Informatique, Unité Associée au CNRS UA 410:AL KHOWARIZMI, 1987.

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

1. Trade-offs among degree, diameter, and number of paths;Discrete Applied Mathematics;2023-03

2. Maximizing Line Subgraphs of Diameter at Most t;SIAM Journal on Discrete Mathematics;2022-04-11

3. $t$-Strong Cliques and the Degree-Diameter Problem;SIAM Journal on Discrete Mathematics;2021-01

4. Maximising Line Subgraphs of Diameter at Most t;Trends in Mathematics;2021

5. Approximate Moore Graphs are good expanders;Journal of Combinatorial Theory, Series B;2020-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP