The number of edges in a bipartite graph of given radius-Reference-Cited by-同舟云学术

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

The number of edges in a bipartite graph of given radius

Published:2011-05 Issue:8-9 Volume:311 Page:690-698
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Dankelmann P.,Swart Henda C.,van den Berg P.

Funder

South African National Research Foundation

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference13 articles.

1. P. Dankelmann, G. Dlamini, H.C. Swart, Upper bounds on distance measures in K2,l-free graphs (in press).

2. Upper bounds on distance measures in K3,3-free graphs;Dankelmann;Util. Math.,2005

3. An upper bound on the radius of a 3-edge-connected graph;Dankelmann;Util. Math.,2007

4. G. Dlamini, Aspects of distances in graphs, Ph.D. Thesis, University of Natal, Durban, 2003.

5. Radius, diameter and minimum degree;Erdös;J. Combin. Theory B,1989

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

1. Maximum size of digraphs of given radius;Discrete Mathematics;2023-08

2. Distances in graphs of girth 6 and generalised cages;Discrete Applied Mathematics;2021-05

3. Distance and size in digraphs;Discrete Mathematics;2015-01

4. The radius of k-connected planar graphs with bounded faces;Discrete Mathematics;2012-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP