59,861 reputation
5148345
bio website nd.edu/~szhorvat/pelican/…
location ND
age
visits member for 2 years, 9 months
seen 3 hours ago

contact details

Please do not write me with Q/A related questions. Post them on the site instead!

Visit Mathematica.SE


Sep
26
answered Enumerating all connected graphs with 9 vertices
Sep
26
comment Enumerating all connected graphs with 9 vertices
Got it finally! I knew I've seen this before. Here's the full list: cs.anu.edu.au/~bdm/data/graphs.html Very likely also used by the previous site I linked.
Sep
26
comment Enumerating all connected graphs with 9 vertices
I found this. It goes up to 9 vertices. I do not know if it is exhaustive, it would be interesting to find out, and especially to have a full list. Perhaps you can try contacting the author of that site?
Sep
26
comment Enumerating all connected graphs with 9 vertices
There is no such database built into Mathematica, so for a pre-made database you'd have to look elsewhere. Generating all unlabelled graphs on 9 vertices and making sure there are no duplicates in the list is going to be hard and definitely impossible using a naive approach of simply using IsomorphicGraphQ to filter duplicates. Not to say it's impossible with smarter methods (it probably is), but how to do it seems hard enough that I'd say it's a math question first, and a Mathematica question only once you have a strategy in mind ...
Sep
26
comment Enumerating all connected graphs with 9 vertices
Actually there seem to be no less than 274668 unlabelled graphs on 9 vertices ... which is much more than what the database can be expected to contain. Voting to close since this question is due to a simple misunderstanding.
Sep
26
comment Enumerating all connected graphs with 9 vertices
OK, I looked at your code. I cannot run it because at the moment I do not have access to a fast enough internet connection to be able to download all the graph data ... However, you seem to be assuming that GraphData[9] will return all possible graphs on 9 vertices. I do not see why this should be so. It is just a non-exhaustive graph database, don't assume it contains everything.
Sep
26
comment Enumerating all connected graphs with 9 vertices
Very important for all such questions: what precise version of Mathematica are you using, on what operating system?
Sep
23
awarded  Nice Answer
Sep
22
awarded  Proofreader
Sep
21
awarded  Nice Answer
Sep
21
comment GraphIntersection Problem
I think there's no function in Mathematica that finds the largest common subgraph for unlabelled graphs.
Sep
21
comment GraphIntersection Problem
Actually it doesn't find the largest common subgraph. It first takes all vertices from the two graph, distinguishing them by their label/name, then discards all edges except the ones that are present in both. So this one: GraphIntersection[Graph[{1 <-> 2}], Graph[{3 <-> 4}]] gives 4 vertices and no edges (not a graph consisting of two connected vertices).
Sep
20
answered Are there more pre-existed ColorFunction options?
Sep
19
comment Returning multiple results from a LibraryLink function
@sakra Thank you for the link, this is a useful read. I still need this.
Sep
19
awarded  Generalist
Sep
17
awarded  Announcer
Sep
16
awarded  Nice Question
Sep
16
awarded  Notable Question
Sep
12
comment How can I access the internal function that plots a molecule from a formatted XYZ file?
@paw Sorry, not right away, and I'll be away from this site for a while starting today ... Try using Information or Names to see if those symbols changed context in v10.
Sep
10
comment Is there a built-in function which detects singularities in a function?
There must be something (possibly undocumented) because the exclusion detection feature of Plot does exactly this.