The block connectivity of random trees

MaRDI QIDQ1010911zbMATH OpenFDO

Authors Andrew R. A. McGrae, Michele Zito

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117293, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r8.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

random treevertex connectivitycollapsing verticesr-block connectivity

Mathematics Subject Classification ID

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

Recommendations

• The connectivity-profile of random increasing \(k\)-trees
• Random Trees in Random Graphs
• Trees in random graphs
• scientific article; zbMATH DE number 1380601
• scientific article; zbMATH DE number 6123974
• Trees in sparse random graphs
• Connectivity of random geometric graphs related to minimal spanning forests
• scientific article; zbMATH DE number 747032
• Spanning trees in random graphs
• On the tree-depth of random graphs

Cited in

(1)

• scientific article; zbMATH DE number 6123974 (Why is no real title available?)

This page was built for publication: The block connectivity of random trees

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