On Oct 11, 2017 1:45 AM, "Jori Mäntysalo" <jori.mantys...@uta.fi> wrote:
1) list(graphs.nauty_geng(0)) gives empty list, whereas Sage knows a graph of 0 vertices. Can someone ask McKay to handle this special case too? Wouldn't it be easier to simply catch that case in the nauty_geng method? 2) Is there an example of graph property that holds after deleting any vertex but not necessarily after deleting an edge? Or the converse? Completeness, if you start with a complete graph, is preserved if you delete a vertex but not if you delete an edge. 3) Currently graphs(...) has parameters vertices and augment. With graphs(n, augment='edges') it generates all n-vertex graphs, whereas graphs(n, augment='vertices') generates all graphs of 0, 1, ..., n vertices. Would it be more logical to have parameters max_vertices and min_vertices? 4) When is augment='edges' usefull? Is sum(sum(1 for _ in graphs(i, augment='edges')) for i in range(9)) faster in someone's computer than sum(1 for _ in graphs(8, augment='vertices')) ? -- Jori Mäntysalo -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
