Random two-component spanning forests (Q902877): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:44, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
