Abstract
We construct directed graphs of specified diameter. We are especially interested in the minimal number of arcs required to construct 2-connected digraphs. Classes of graphs considered are unconstrained digraphs, digraphs without cycles of length 2, and digraphs with fixed indegree and outdegree.
This work was supported by the Natural Sciences and Engineering Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Dawes and H. Meijer, Arc-Minimal Digraphs of Specified Diameter, J. of Comb. Math. and Comb. Computing 1 (1987), 85–96.
G. Katona and E. Szemerédi, On a Problem of Graph Theory, Studia Sci. Math. Hungar. 2 (1967), 23–28.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meijer, H., Dawes, R. (1989). Fault tolerant networks of specified diameter. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-50728-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50728-4
Online ISBN: 978-3-540-46076-3
eBook Packages: Springer Book Archive