CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS
- 1 June 2000
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 11 (02) , 247-262
- https://doi.org/10.1142/s0129054100000156
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- The asymptotic distribution of short cycles in random regular graphsJournal of Combinatorial Theory, Series B, 1981
- Graphs as models of communication network vulnerability: Connectivity and persistenceNetworks, 1981
- The distribution of the maximum degree of a random graphDiscrete Mathematics, 1980
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975