scientific article; zbMATH DE number 4029600

MaRDI QIDQ3770563zbMATH OpenFDO

Authors Jerzy Jaworski, Ipe H. Smit

Publication date 1987

zbMATH Keywords

connectivitydistributionmaximum vertex degreeminimum vertex degreerandom digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 845673
• On randomly n-cyclic digraphs
• On random digraphs and cores
• Random circulant digraphs
• On the shape of a random acyclic digraph
• scientific article; zbMATH DE number 7651064
• Random threshold digraphs
• The random graph
• On randomly \(k\)-dimensional graphs
• On a method for random graphs

Cited in

(17)

• An exact threshold theorem for random graphs and the node-packing problem
• Susceptible-infected-removed epidemic models with dynamic partnerships
• Six Ways of Looking at Burtin's Lemma
• On the degree sequence of random geometric digraphs
• The transitive closure of a random digraph
• On the construction of random digraphs with marked edges
• Two Models of Random Intersection Graphs and their Applications
• In-degree sequence in a general model of a random digraph
• Random threshold digraphs
• scientific article; zbMATH DE number 1210632 (Why is no real title available?)
• A note on the connectivity of 2‐regular digraphs
• Connectivity of a general class of inhomogeneous random digraphs
• A classification of isomorphism-invariant random digraphs
• Component evolution in a secure wireless sensor network
• The diameter of randomly perturbed digraphs and some applications
• scientific article; zbMATH DE number 2188468 (Why is no real title available?)
• The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected

This page was built for publication:

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