Counting unlabeled bipartite graphs using Polya's theorem (Q668962)
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 7038547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting unlabeled bipartite graphs using Polya's theorem |
scientific article; zbMATH DE number 7038547 |
Statements
Counting unlabeled bipartite graphs using Polya's theorem (English)
0 references
20 March 2019
0 references
bipartite graphs
0 references
cycle index polynomial
0 references
graph enumeration
0 references
Polya's counting theorem
0 references
0.7706295847892761
0 references
0.7671893239021301
0 references
0.7625088095664978
0 references
0.7585256695747375
0 references
0.7557094097137451
0 references
