|
| |
|
|
A079565
|
|
Number of unlabeled and connected graphs on n vertices which are either bipartite or co-bipartite. (G is bipartite iff the vertices can be partitioned into two sets such that all the edges in the graph go from one of these sets to the other. G is cobipartite iff the complement of G is bipartite.).
|
|
0
| | |
|
|
|
OFFSET
| 1,3
|
|
|
EXAMPLE
| Let G be a graph with 5 vertices, 4 of which form a path and the 5th adjacent only to the two vertices in the middle of the path. Then G is not bipartite nor cobipartite because there is a triangle in both G and its complement.
|
|
|
CROSSREFS
| Sequence in context: A046721 A151528 A132803 * A052890 A052814 A192401
Adjacent sequences: A079562 A079563 A079564 * A079566 A079567 A079568
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Jim Nastos (nastos(AT)gmail.com), Jan 24 2003
|
| |
|
|
