Abstract
We present some results devoted to the existence, numbers and orders of strong connected clusters and cliques in random digraphs and their match-graphs. These results may provide an interesting sociological interpretation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
BOLLOBÉIS, B., (1985): Random Graphs, Academic Press Inc. (London) Ltd.
BOLLOBAS, B. and ERDÖS, P. (1976): Cliques in Random Graphs. Math. Proc. Carob. Phil. Soc. 80, 419–427.
JAWORSKI, J. and PALKA, Z., (1997): Subgraphs of Random Match-graphs. Submitted.
JAWORSKI, J. and PALKA, Z., (1998): Remarks on a General Model of a Random Digraph. Submitted.
JAWORSKI, J. and SMIT, I., (1987): On a Random Digraph. Annals of Discrete Math. 33, 111–127.
PALKA, Z., RUCINSKI, A. and SPENCER, J., (1986): On a Method for Random Graphs. Discrete Math. 61, 253–258.
SMIT, I., (1979): The Distribution of the Number of Two-cycles in Certain Kinds of Random Digraphs. Vrije Universiteit, Amsterdam, Rapport Nr 116
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Jaworski, J., Palka, Z. (1999). Match-Gaphs of Random Digraphs. In: Gaul, W., Locarek-Junge, H. (eds) Classification in the Information Age. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60187-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-60187-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65855-9
Online ISBN: 978-3-642-60187-3
eBook Packages: Springer Book Archive