Connectivity of finite anisotropic random graphs and directed graphs

DOI10.1017/S0305004100064239zbMath0605.60011MaRDI QIDQ3742403

Joel E. Cohen

Publication date: 1986

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

random graphsgraphs on a finite set of verticesRecursive formulas for computing the reliabilityreliability and redundancy

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Related Items (1)

On connectivity and robustness of random graphs with inhomogeneity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity in random networks
• The dissection of rectangles into squares
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Number of Components in Random Linear Graphs
• On the strength of connectedness of a random graph
• A random graph
• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
• On graphs with randomly deleted edges
• Algebraic Graph Theory
• Connectivity of random graphs
• A review of random graphs
• Random Graphs
• Association of Random Variables, with Applications
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Inequalities: theory of majorization and its applications

This page was built for publication: Connectivity of finite anisotropic random graphs and directed graphs