COUNTABLY APPROXIMATING FRAMES

DOI10.4134/CKMS.2002.17.2.295MaRDI QIDQ4955029zbMATH OpenOpenAlexFDO

Authors Chang Woo Lee

Publication date 12 June 2000

Published in Communications of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/ckms.2002.17.2.295

zbMATH Keywords

connectedgiant componentquasi-random graph

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• On the connectedness of a random graph
• Connectedness of certain random graphs
• On the strength of connectedness of a random graph
• scientific article; zbMATH DE number 3999977
• A note on quasi k-connected graphs
• On the connectivity of a random interval graph
• On the strength of connectedness of a random hypergraph
• \(k\)-connectivity in random graphs
• Bounds on probability of connectedness of a random graph
• Quasirandomness in Graphs

Cited in

(3)

• Note on directed proper connection number of a random graph
• On the strength of connectedness of a random hypergraph
• Eigenvalues and extremal degrees of graphs

This page was built for publication: COUNTABLY APPROXIMATING FRAMES

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