Majorization and the number of bipartite graphs for given vertex degrees
The emph{bipartite realisation problem} asks for a pair of non-negative, non-increasing integer lists $a:=(a_1,ldots,a_n)$ and $b:=(b_1,ldots,b_{n'})$ if there is a labeled bipartite graph $G(U,V,E)$ (no loops or multiple edges) such that each vertex $u_i in U$ has degree $a_i$ and each verte...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2018-03-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://toc.ui.ac.ir/article_21469_4550ee854fabeca9498c8036d49fbd87.pdf |