Counting unlabeled bipartite graphs using Polya's theorem (Q668962)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting unlabeled bipartite graphs using Polya's theorem |
scientific article |
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
