Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. The smallest number of edges in a 2-connected graph with specified diameter;Belotserkovsky;Discrete Mathematics,2007
2. Graphs and interconnection networks: diameter and vulnerability;Bermond,1983
3. A problem of the theory of communication networks;Bollobás;Acta Mathematica Hungarica,1968
4. Extremal graphs of diameter 4;Caccetta;Journal of Combinatorial Theory,1976
5. Extremal graphs of diameter 3;Caccetta;Journal of the Australian Mathematical Society-Series A,1979
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献