Count of connected bipartite graphs with even number of vertices up to isomorphism

Asked Aug 23 '16 at 19:05

Active Aug 24 '16 at 02:51

Viewed 214 times

Suppose graph $G$ is connected bipartite with an even number $n$ of vertices. How can I count the number of such graphs that are not isomorphic?

For example if $n=2$ the answer is $1$, if $n=4$ the answer is $3$, and if $n=6$ the answer is $17$.

I would so appreciate if someone can help me!

edited Aug 24 '16 at 02:51

hardmath

asked Aug 23 '16 at 19:05

look it again pls – Aug 23 '16 at 19:17
@hardmath nothing else for example if $n=2$ the answer is $1$ , if $n=4$ the answer is $3$ and if $n=6$ the answer is $17$... – Aug 23 '16 at 19:29
@hardmath $n$ is equal number of vertex in graph – Aug 23 '16 at 19:34
That is so important to your problem that it needs to be stated in the Question itself, not just a comment. – hardmath Aug 23 '16 at 19:35
Let us continue this discussion in chat. – Aug 23 '16 at 19:39
3

This MSE link could prove useful reading. – Marko Riedel Aug 23 '16 at 20:11
4

See OEIS sequence A05142 and links there. – Robert Israel Aug 24 '16 at 02:58
1

I have edited in the role of $n$ being an even number of vertices, which at least restricts us to a finite count (depending on $n$). – hardmath Aug 24 '16 at 02:59
@RobertIsrael THX about your link :-) – Aug 24 '16 at 11:22

0 Answers0