Connectivity of finite anisotropic random graphs and directed graphs

DOI10.1017/S0305004100064239MaRDI QIDQ3742403zbMATH OpenFDO

Authors Joel E. Cohen

Publication date 1986

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

Full work available at URL https://doi.org/10.1017/S0305004100064239

zbMATH Keywords

graphs on a finite set of verticesrandom graphsRecursive 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)

Recommendations

• Graphs with given connectivity properties
• scientific article; zbMATH DE number 3884207
• scientific article; zbMATH DE number 4091558
• Network reliability
• scientific article; zbMATH DE number 3880759

Cites work

• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• A random graph
• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
• A review of random graphs
• Algebraic Graph Theory
• Association of Random Variables, with Applications
• Connectivity in random networks
• Connectivity of random graphs
• scientific article; zbMATH DE number 3760195 (Why is no real title available?)
• scientific article; zbMATH DE number 3450155 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3358495 (Why is no real title available?)
• Inequalities: theory of majorization and its applications
• On graphs with randomly deleted edges
• On the strength of connectedness of a random graph
• Random Graphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The dissection of rectangles into squares
• The Number of Components in Random Linear Graphs

Cited in

(8)

• Note on directed proper connection number of a random graph
• Connectivity of soft random geometric graphs over annuli
• The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees
• Graphs with given connectivity properties
• Connectivity in random forests and credit networks
• Random Accessibility as a Parallelism to Reliability Studies on Simple Graphs
• On connectivity and robustness of random graphs with inhomogeneity
• Connectivity and dynamics for random subgraphs of the directed cube

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742403)