ℓ \ell ‐Connectivity and ℓ \ell ‐edge‐connectivity of random graphs

DOI10.1002/JGT.22807MaRDI QIDQ6081885zbMATH OpenOpenAlexFDO

Authors Ran Gu, Xiaofeng Gu, Yongtang Shi, Hua Wang

Publication date 5 October 2023

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.22807

zbMATH Keywords

\(\ell\)-connectivity\(\ell\)-edge-connectivityhitting timerandom graphthreshold function

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• \(k\)-connectivity in random graphs
• On the connectedness of a random graph
• Connectedness of certain random graphs
• Connectivity of random k-nearest-neighbour graphs
• On the connectivity of a random interval graph
• On the strength of connectedness of a random graph
• Bounds on probability of connectedness of a random graph
• On the Connectivity of Random k-th Nearest Neighbour Graphs
• Lower bounds of connectedness probability for some classes of random graphs
• Connectedness of graphs generated by a random d-process

Cites work

• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• A lower bound of the \(l\)-edge-connectivity and optimal graphs
• A proof of Brouwer's toughness conjecture
• Bounds on the size of graphs of given order and \(l\)-connectivity
• Characterization of minimally (2,l)-connected graphs
• Component connectivity of hypercubes
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Graph theory
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3878974 (Why is no real title available?)
• scientific article; zbMATH DE number 3943863 (Why is no real title available?)
• scientific article; zbMATH DE number 3773644 (Why is no real title available?)
• scientific article; zbMATH DE number 1289751 (Why is no real title available?)
• Minimally (k, k)‐edge‐connected graphs
• Mixed connectivity properties of random graphs and some special graphs
• On the -connectivity of a graph
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• On the strength of connectedness of a random graph
• Paths in graphs
• Random Graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The Strength of Connectivity of a Random Graph
• Tough graphs and Hamiltonian circuits.
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• Toughness in graphs -- a survey
• Toughness in pseudo-random graphs

Cited in

(10)

• Lower bounds of connectedness probability for some classes of random graphs
• Mixed connectivity of random graphs
• Edge rigidity and universality of random regular graphs of intermediate degree
• On resilience of connectivity in the evolution of random graphs
• Stationary random graphs on Z with prescribed iid degrees and finite mean connections
• scientific article; zbMATH DE number 30760 (Why is no real title available?)
• Connectedness of graphs generated by a random d-process
• l-connectivity, l-edge-connectivity and spectral radius of graphs
• Generalized toughness and spectral radius of graphs
• Connectivity properties of the adjacency graph of \(\text{SLE}_{\kappa}\) bubbles for \(\kappa\in(4,8)\)

This page was built for publication: ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs

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