[Nauty] Generate all non-isomorphic graphs without edges between the last k vertices
Andy Mercer
andymercer at cox.net
Thu Jun 13 21:58:44 AEST 2019
What do you mean by "no edges within the subset of vertices > k "? Do
you want all non-isomorphic graphs on N vertices having at least k
isolated nodes (at least k nodes of degree zero)?
Andy
On 6/12/2019 5:28 PM, J.K.R. Bausch wrote:
> Hi all!
>
> I would like to generate all non-isomorphic graphs on N vertices (e.g.
> N=10), but such that there is no edges within the subset of vertices >
> k (e.g. k=6).
>
> Is that possible with geng? Or any other idea?
>
> Thanks & best,
> Johannes
> _______________________________________________
> Nauty mailing list
> Nauty at anu.edu.au
> http://mailman.anu.edu.au/mailman/listinfo/nauty
More information about the Nauty
mailing list