|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| M.A. Fiol, J.L.A. Yebra, I.A. De Miquel, "Line Digraph Iterations and the (d, k) Digraph Problem," IEEE Transactions on Computers, vol. 33, no. 5, pp. 400-403, May, 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1984.1676455, author = {M.A. Fiol and J.L.A. Yebra and I.A. De Miquel}, title = {Line Digraph Iterations and the (d, k) Digraph Problem}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {5}, issn = {0018-9340}, year = {1984}, pages = {400-403}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676455}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Line Digraph Iterations and the (d, k) Digraph Problem IS - 5 SN - 0018-9340 SP400 EP403 EPD - 400-403 A1 - M.A. Fiol, A1 - J.L.A. Yebra, A1 - I.A. De Miquel, PY - 1984 KW - routing algorithm KW - Communication network KW - (d KW - k) graph problem KW - line digraph KW - Moore bound VL - 33 JA - IEEE Transactions on Computers ER - | |||
This paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, to maximize the number of vertices in a digraph of maximum out-degree d and diameter k. By line digraph iterations it is possible to construct digraphs with a number of vertices larg
Index Terms:
routing algorithm, Communication network, (d, k) graph problem, line digraph, Moore bound
Citation:
M.A. Fiol, J.L.A. Yebra, I.A. De Miquel, "Line Digraph Iterations and the (d, k) Digraph Problem," IEEE Transactions on Computers, vol. 33, no. 5, pp. 400-403, May 1984, doi:10.1109/TC.1984.1676455
Usage of this product signifies your acceptance of the Terms of Use.