Mixed connectivity properties of random graphs and some special graphs

DOI10.1007/s10878-019-00415-zzbMath1480.90212OpenAlexW2945248886MaRDI QIDQ2051904

Neng Fan, Yongtang Shi, Ran Gu

Publication date: 25 November 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00415-z

zbMATH Keywords

connectivityrandom graphhitting timeedge-connectivitythreshold functionmixed connectivity

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs ⋮ The complexity of mixed-connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold functions
• A mixed version of Menger's theorem
• Mixed connectivity of random graphs
• On minimally \((n,\lambda)\)-connected graphs
• On the strength of connectedness of a random graph
• The Strength of Connectivity of a Random Graph
• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• Minimally (k, k)‐edge‐connected graphs
• Every monotone graph property has a sharp threshold
• Paths in graphs
• The connectivity function of a graph
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$

This page was built for publication: Mixed connectivity properties of random graphs and some special graphs