|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Connectivity of Regular Directed Graphs with Small Diameters
March 1985 (vol. 34 no. 3)
pp. 267-273
| ASCII Text | x | ||
| M. Imase, T. Soneoka, K. Okada, "Connectivity of Regular Directed Graphs with Small Diameters," IEEE Transactions on Computers, vol. 34, no. 3, pp. 267-273, March, 1985. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1985.1676569, author = {M. Imase and T. Soneoka and K. Okada}, title = {Connectivity of Regular Directed Graphs with Small Diameters}, journal ={IEEE Transactions on Computers}, volume = {34}, number = {3}, issn = {0018-9340}, year = {1985}, pages = {267-273}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1985.1676569}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Connectivity of Regular Directed Graphs with Small Diameters IS - 3 SN - 0018-9340 SP267 EP273 EPD - 267-273 A1 - M. Imase, A1 - T. Soneoka, A1 - K. Okada, PY - 1985 KW - interconnection networks KW - Communication networks KW - connectivity maximization KW - diameter minimization KW - directed graphs VL - 34 JA - IEEE Transactions on Computers ER - | |||
This paper clarifies the relation between the diameter k and the edge or node connectivity Ce or c,, of digraphs. The following two inequalities are derived: where n is the number of nodes, d is the maximum degree, and d is the minimum degree.
Index Terms:
interconnection networks, Communication networks, connectivity maximization, diameter minimization, directed graphs
Citation:
M. Imase, T. Soneoka, K. Okada, "Connectivity of Regular Directed Graphs with Small Diameters," IEEE Transactions on Computers, vol. 34, no. 3, pp. 267-273, March 1985, doi:10.1109/TC.1985.1676569
Usage of this product signifies your acceptance of the Terms of Use.