On the connectivity of random m-orientable graphs and digraphs
From MaRDI portal
Publication:1056764
DOI10.1007/BF02579431zbMath0523.05056OpenAlexW1577466578WikidataQ57401644 ScholiaQ57401644MaRDI QIDQ1056764
Trevor I. Fenner, Alan M. Frieze
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579431
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)
Related Items
Finding Hamilton cycles in sparse random graphs, On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees, Maximum matchings in a class of random graphs, Maximal paths in random dynamic graphs, Understanding Policy Diffusion in the U.S.: An Information-Theoretical Approach to Unveil Connectivity Structures in Slowly Evolving Complex Systems, On the 2‐cyclic property in 2‐regular digraphs, Connectivity of the k-Out Hypercube, An accurate, scalable and verifiable protocol for federated differentially private averaging, Practical provably secure flooding for blockchains, Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\), The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected, On randomk-out subgraphs of large graphs, Unnamed Item, Matchings and cycle covers in random digraphs, On the largest strong components in \(m\)-out digraphs, On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, On the equational graphs over finite fields, Hamilton cycles in 3-out, The strong giant in a random digraph, Edge disjoint spanning trees in random graphs, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter, Hamiltonian Berge cycles in random hypergraphs, On the existence of Hamiltonian cycles in a class of random graphs, Diameter and stationary distribution of random \(r\)-out digraphs, Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs, Random near-regular graphs and the node packing problem, On the value of a random minimum spanning tree problem, Connectivity threshold of Bluetooth graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the existence of Hamiltonian cycles in a class of random graphs
- On the Expected Value of a Random Assignment Problem
- On the strength of connectedness of a random graph
- The Expected Number of Components Under a Random Mapping Function
- Probability of Indecomposability of a Random Mapping Function
