OFFSET
0,4
COMMENTS
A semi-bipartite structure is a triple (G,U,V) such that G is a simple graph, U and V form a partition of V[G], and U is isolated in G. a(n) counts non-isomorphic triples (G,U,V) on n unlabeled vertices such that G is connected.
Since U and V form a partition, both must be nonempty. When U or V can be empty, the corresponding sequence is A394610.
When G isn't required to be connected, the corresponding sequence is A394754.
EXAMPLE
For n = 3: a(2)=1 with the following structure: two connected vertices with one in U and the other in V.
CROSSREFS
KEYWORD
nonn
AUTHOR
Piotr Mitosek, Mar 31 2026
STATUS
approved
