login
Number of unlabeled, connected graphs on n nodes which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite nor split and are primes.
0

%I #11 Jan 25 2016 08:48:46

%S 0,0,0,0,0,0,6,34,206,1322,9264,73181

%N Number of unlabeled, connected graphs on n nodes which have no induced subgraph isomorphic to a P5, P5-bar or C5 and are not bipartite nor cobipartite nor split and are primes.

%C P5 = path on five nodes. P5-bar = complement of P5. C5 = cycle on five nodes. Cobipartite means having a bipartite complement. G prime if G has no module (homogeneous set.) G split iff G and the complement of G are chordal.

%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties.

%K more,nonn

%O 1,7

%A _Jim Nastos_, Jan 24 2003

%E a(10)-a(12) added using tinygraph by _Falk Hüffner_, Jan 25 2016