Random two-component spanning forests (Q902877)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random two-component spanning forests |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random two-component spanning forests |
scientific article |
Statements
Random two-component spanning forests (English)
0 references
4 January 2016
0 references
The authors study random two-component spanning forests, that is subgraphs of a given finite graph \(\mathcal{G}\) in \(\mathbb{R}^d,\) containing no cycles and having two connected components. They give formulas for the size of these components, and study some properties regarding their vertices and edges.
0 references
two-component spanning forests
0 references
Mean resistance
0 references
torsional rigidity
0 references
0 references
0.8009757995605469
0 references
0.7847180366516113
0 references
0.7809801697731018
0 references
