Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with bipartite-graphs
Search options not deleted
user 37134
A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that no two vertices in the same set are adjacent.
2
votes
Enumeration of labeled connected bipartite graphs given partite sets
Found the answer in Labeled Bipartite Blocks by F. Harary and R. W. Robinson (http://cms.math.ca/cjm/v31/cjm1979v31.0060-0068.pdf , page 63, formula 11):
$$C(m, n) = 2^{nm} - \sum{* \binom{n - 1}{a - …
- 43
2
votes
2
answers
770
views
Enumeration of labeled connected bipartite graphs given partite sets
What would be the closed-form expression defining number of all possible labelled connected bipartite graphs given $\mid X \mid = m, \mid Y \mid = n - m $?
- 43