Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2025-09-18 09:56:30 +0200 | received badge | ● Famous Question (source) |
| 2020-10-08 15:31:04 +0200 | received badge | ● Notable Question (source) |
| 2017-10-19 09:55:55 +0200 | received badge | ● Popular Question (source) |
| 2015-09-04 04:31:31 +0200 | commented answer | How do I generate list of connected graphs with given number of vertices? Yes, I meant the documentation of nauty-geng. I got you now. Thank you very much for your assistance Nathann..:) |
| 2015-08-27 10:06:46 +0200 | received badge | ● Scholar (source) |
| 2015-08-27 06:56:03 +0200 | commented answer | How do I generate list of connected graphs with given number of vertices? Could you please share that document with me? Or any link where I could find that.? |
| 2015-08-25 07:07:30 +0200 | asked a question | How do I generate list of connected graphs with given number of vertices? I have used this short nauty program to generate graphs with given number of vertices, edges and degree information. c =0 for G in graphs . nauty_geng (’9 12 -d4D4 ’) : c = c +1 print " graph "+str( c ) +" ( graph6 string ’"+ G . graph6_string () +" ’):" G . adjacency_matrix () G . show () print "" print "" It generates a list of all graph with given information. My query is that How do I filter them to get only connected ones? |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.