|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Large Graphs with Given Degree and Diameter?Part I
September 1984 (vol. 33 no. 9)
pp. 857-860
| ASCII Text | x | ||
| C. Delorme, G. Farhi, "Large Graphs with Given Degree and Diameter?Part I," IEEE Transactions on Computers, vol. 33, no. 9, pp. 857-860, September, 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1984.1676504, author = {C. Delorme and G. Farhi}, title = {Large Graphs with Given Degree and Diameter?Part I}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {9}, issn = {0018-9340}, year = {1984}, pages = {857-860}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676504}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Large Graphs with Given Degree and Diameter?Part I IS - 9 SN - 0018-9340 SP857 EP860 EPD - 857-860 A1 - C. Delorme, A1 - G. Farhi, PY - 1984 KW - undirected graphs KW - (d KW - k)-graph problem KW - interconnection networks KW - regular networks VL - 33 JA - IEEE Transactions on Computers ER - | |||
The following problem arises in the study of interconnection networks: find graphs of given diameter and degree having the maximum number of vertices. In this correspondence we give some constructions of graphs proving in particular that lim?8inf N(?, D).?-D = 2-D, where N(?, D) is the maximum number of vertices of a graph with degree A and diameter D.
Index Terms:
undirected graphs, (d, k)-graph problem, interconnection networks, regular networks
Citation:
C. Delorme, G. Farhi, "Large Graphs with Given Degree and Diameter?Part I," IEEE Transactions on Computers, vol. 33, no. 9, pp. 857-860, Sept. 1984, doi:10.1109/TC.1984.1676504
Usage of this product signifies your acceptance of the Terms of Use.