Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
From MaRDI portal
Publication:5666590
DOI10.1137/1117029zbMath0253.05136OpenAlexW1998243136MaRDI QIDQ5666590
Publication date: 1972
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1117029
Related Items (18)
Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ Super Edge-Connected Linear Hypergraphs ⋮ A characterization of graphs by codes from their incidence matrices ⋮ Results on the edge-connectivity of graphs ⋮ Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ Zero-divisor super-\(\lambda\) graphs ⋮ Codes from incidence matrices of graphs ⋮ Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number ⋮ On the existence of super edge-connected graphs with prescribed degrees ⋮ Super \(\lambda_3\)-optimality of regular graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Inverse degree and super edge-connectivity ⋮ Designs with blocks of size two and applications to microarray experiments ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected ⋮ Tree and forest weights and their application to nonuniform random graphs
This page was built for publication: Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
