scientific article; zbMATH DE number 125466

MaRDI QIDQ4027166zbMATH OpenFDO

Authors Urszula Konieczna

Publication date 21 February 1993

zbMATH Keywords

\(n\)-cubeasymptotic behaviourinduced subgraphsisolated edgesrandom subgraphsspanning subgraphs

Mathematics Subject Classification ID

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

Review text

[For the entire collection see Zbl 0748.00023.] The \(n\)-cube \(Q_ n\) is the graph with \(2^ n\) vertices labelled by sequences \((a_ 1,\dots,a_ n)\), \(a_ i\in\{0,1\}\) and \(n2^{n-1}\) edges between vertices differing in exactly one coordinate. The authoress considers two types of random subgraphs of the \(n\)-cube: induced subgraphs and spanning subgraphs, and studies the asymptotic behaviour of the number of isolated edges of these models.

Recommendations

• scientific article; zbMATH DE number 4010568
• scientific article; zbMATH DE number 4039957
• Poisson Convergence in the n‐Cube
• scientific article; zbMATH DE number 3966129
• scientific article; zbMATH DE number 747047

Cited in

(5)

• Fast canonical labeling of random subgraphs
• scientific article; zbMATH DE number 5369609 (Why is no real title available?)
• Poisson Convergence in the n‐Cube
• Detecting tampering in a random hypercube
• scientific article; zbMATH DE number 812059 (Why is no real title available?)

This page was built for publication:

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