I'd like to get all at most 15 vertices Non-isomorphic connected bipartite graphs. One way is to use the function NonIsomorphicGraphs(k, output = graphs, outputform = graph, restrictto = connected).
s1:=[NonIsomorphicGraphs(k,restrictto = connected,output=graphs,outputform=graph)]:
But when k=9, it is slow, I doubted that the code
By Checking out the encyclopedia，http://oeis.org/A033995 , we knew the following number of bipartite graphs datas of , at most 14, they are not many（the datas contain no-connected conditions)
so I read the help document about
Ps： I know in SageMath we can get all bipartite graphs quikly even though n>=10 by using the
for g in graphs.nauty_geng('-c -b 10 -g'):
But I hope it can be realized in Maple.