Loading [MathJax]/extensions/MathMenu.js
Connectivity of Regular Directed Graphs with Small Diameters | IEEE Journals & Magazine | IEEE Xplore

Connectivity of Regular Directed Graphs with Small Diameters


Abstract:

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 t...Show More

Abstract:

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.
Published in: IEEE Transactions on Computers ( Volume: C-34, Issue: 3, March 1985)
Page(s): 267 - 273
Date of Publication: 31 March 1985

ISSN Information:


References

References is not available for this document.