Splitting formulas for computing connectedness probability of undirected graphs (Q3483062)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4154189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Splitting formulas for computing connectedness probability of undirected graphs |
scientific article; zbMATH DE number 4154189 |
Statements
Splitting formulas for computing connectedness probability of undirected graphs (English)
0 references
1990
0 references
Tutte polynomial
0 references
splitting formula
0 references
connectedness probability
0 references
connected undirected graphs
0 references
0.7712571024894714
0 references
0.7701525092124939
0 references
0.7678546905517578
0 references
