On the size of two families of unlabeled bipartite graphs
Let denote the set of unlabeled bipartite graphs whose edges connect a set of vertices with a set of vertices. In this paper, we provide exact formulas for and using Polya’s Counting Theorem. Extending these results to involves solving a set of complex recurrences and remains open. In particular, th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.11.008 |