Connectivity threshold for random chordal graphs

DOI10.1007/BF01788142MaRDI QIDQ1175564zbMATH OpenOpenAlexFDO

Authors Edward Scheinerman, F. R. McMorris

Publication date 25 June 1992

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01788142

zbMATH Keywords

thresholdconnectivity[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-R%EF%BF%BD%EF%BF%BDnyi+model&go=Go Erd��s-R��nyi model]random chordal graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Connectedness of certain random graphs
• The connectivity threshold for the min‐degree random graph process
• A note on thresholds and connectivity in random directed graphs
• The connectivity threshold of random geometric graphs with Cantor distributed vertices
• On the connectedness of a random graph
• Bounds on probability of connectedness of a random graph
• On the connectivity of a random interval graph
• scientific article; zbMATH DE number 15665
• \(k\)-connectivity in random graphs
• Connectivity of random k-nearest-neighbour graphs

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3910422 (Why is no real title available?)
• An evolution of interval graphs
• Representations of chordal graphs as subtrees of a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(14)

• Constant threshold intersection graphs of orthodox paths in trees
• Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
• Tree representations of graphs
• Intersection models of weakly chordal graphs
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
• What Is between Chordal and Weakly Chordal Graphs?
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• Recognizing vertex intersection graphs of paths on bounded degree trees
• On the connectivity threshold of Achlioptas processes
• The connectivity threshold for the min‐degree random graph process
• The intersection graph of random sets
• Intersection graphs of orthodox paths in trees
• Constant tolerance intersection graphs of subtrees of a tree
• scientific article; zbMATH DE number 3910422 (Why is no real title available?)

This page was built for publication: Connectivity threshold for random chordal graphs

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