Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2022-08-13 09:34:36 +0200 | received badge | ● Nice Question (source) |
| 2019-11-21 04:00:33 +0200 | received badge | ● Famous Question (source) |
| 2017-02-17 10:13:12 +0200 | received badge | ● Popular Question (source) |
| 2017-02-17 10:13:12 +0200 | received badge | ● Notable Question (source) |
| 2015-02-18 11:12:41 +0200 | received badge | ● Student (source) |
| 2015-02-18 04:04:45 +0200 | asked a question | Generating all non-isomorphic bipartite graphs of certain partitions Hi everyone. I'm new here and I'm also new in using Sage. I hope someone here could help with what I am trying to do. I would like to generate all non-isomorphic bipartite graphs given certain partitions. In other words, if $K_{(m,n)}$ is the complete bipartite graph with $m$ and $n$ being the number of vertices in each of its partitions, then what I would like to find is all the spanning subgraphs of $K_{(m,n)}$. These graphs would be bipartite and can be partitioned into two sets with one set having $m$ elements while the other have $n$. That's it. How could I find all non-isomorphic bipartite graphs with bi-partitions of sizes $n$ and $m$ respectively? Thank you! |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.