0 years, 93 days

## thanks...

@acer thanks a lot , I learn a lot from your documentation.

## Thanks...

@tomleslie Thanks,I make it.

## Thank you for your generosity...

@Kitonum   Thank you for your generosity. It helps me lot.

## Thanks...

@vv  So, I want to aviod  this way Graphs_data:=[NonIsomorphicGraphs(4,restrictto =[connected], output = graphs, outputform =graph)]:  Since  the n=9  we already have 261080 graphs ， but
diameter 2 graphs are not many when n=9

## You're right...

@Joe Riel  These are really two different  questions,  In [1,1,2,2].   1 is  the second in my original intention.

@mmcdara  I have realized your ideas. It is convenient to use your way test  for C4 or Kq.

## thank you very much .It really helped me...

@vvthank you very much .It really helped me a lot

## Thanks...

@tomleslie Thank you very much for the code you provided, which is exactly what I need. Maybe the algorithmIt's a little bit more complicated.

## Thanks. But it is a pity that It doesn...

@Kitonum Thanks.  But it is a pity that  It doesn't solve my problem.
The difficult point is how to research the specific graph.

## @sand15  What you said inspired me ...

@sand15  What you said inspired me a lot. May be I should change  strategy .

## That's unfortunate and inconvenient...

@tomleslie  Thanks you first,  Just, in mathematica， I create it.  So I  hope Maple may improve it in the future.

## @dharr I try it, and  make it. Than...

@dharr I try it, and  make it. Thank you very much.

## @sand15 I am very thanks to you for this...

@sand15 I am very thanks to you for this act of kindness

## @Carl Love thanks sir...

@Carl Love thanks sir

 1 2 Page 1 of 2
﻿