What does GraphData["Cubic", n] do?

Question

I don't have Mathematica, yet, but I just wanted to know what the output of the following was:

GraphData["Cubic", 20]

I'm trying to understand how many unique not-necessarily-connected cubic graphs on $20$ vertices there are. Like, these are all connected cubic graphs on 20 vertices, but I know there are other arrangements (disjoint ones too). For example, you could have two cubic graphs on 4 vertices and two cubic graphs on 6 vertices, which gives 20 vertices all with degree 3, but there are four disjoint graphs that make them up. What am I looking for? I want to see all the unique ways 20 vertices can all have degree 3.

Update: GraphicsGrid[GraphData/@GraphData["Cubic",20],"AllImages"] produces the following: http://docdro.id/p9Rim76

GraphData queries a database. The answers it returns are not usually exhaustive. — Szabolcs, Aug 08 '17 at 07:09
GraphData is complete when the number of graphs in question is not "too large". For example, it includes all simple graphs up to 7 nodes, all cubic graphs up to 10 nodes, etc. There are 516344 cubic graphs on 20 nodes; GraphData cannot possibly store data for them all. (There is however no reason it could not include all cubic graphs up to 14 nodes; I will add them for a future version.) — Eric W, Aug 08 '17 at 15:14
@EricWeisstein, how can I see, like, the first 100 of those 516344 cubic graphs? — , Aug 08 '17 at 16:47
@CarlWoll, there is a discrepancy in the numbers reported. 516344 $\neq$ 510489. Why? — , Aug 08 '17 at 17:27
The article discusses generating connected cubic graphs, hence the discrepancy. — Carl Woll, Aug 08 '17 at 17:30

score 1 · Answer 1 · answered Aug 08 '17 at 06:40

1

the output is :

{{CrossedPrism,10},CrossingNumberGraph6B,CrossingNumberGraph6C,{Cubic,{20,1}},{Cubic,{20,2}},{Cubic,{20,3}},{CubicTransitive,25},{CubicTransitive,28},DesarguesGraph,DodecahedralGraph,FiveTetrahedra,FlowerSnarkJ5,{GeneralizedPetersen,{10,4}},{Incidence,{{10,3},3}},{Incidence,{{10,3},5}},{Incidence,{{10,3},7}},{Incidence,{{10,3},8}},{Incidence,{{10,3},9}},{LargestCubicNonplanarDiameter,3},{MoebiusLadder,10},{Prism,10},{Snark,{20,1}},{Snark,{20,2}},{Snark,{20,3}},{Snark,{20,4}},{Snark,{20,5}},Two5MoebiusLadders,TwoPetersenGraphs,TwoY5}

answered Aug 08 '17 at 06:40

Alucard

2,639
13
22

Ok, now, how do I see all of them? – Aug 08 '17 at 16:05
Actually, GraphicsGrid[GraphData/@GraphData["Cubic",20],UpTo[7]] works for me. – Aug 08 '17 at 16:08
So, GraphicsGrid[GraphData/@GraphData["Cubic",20],"AllImages"] is incomplete? – Aug 08 '17 at 16:24
@uwnojpjm, what were you missing? – J. M.'s missing motivation Aug 08 '17 at 16:36
Someone said there were "516344" cubic nodes on 20 vertices. GraphData queries a database apparently, and it's not exhaustive. – Aug 08 '17 at 16:42
you should ask to eric in the comment section under your first post. i don't know enough about graph theory to help you – Alucard Aug 08 '17 at 16:46

score 1 · Accepted Answer · answered Aug 08 '17 at 06:46

Go here: link to online evaluator

Wait a moment for it to stabilize

Click on "Create a New Notebook" on the right side

Wait a moment for it to stabilize

Paste (or type) GraphData["Cubic", 20] into the large empty white space

Wait a moment for it to stabilize

Click Evaluation in the upper right and then click Evaluate Cells

Wait a moment for it to stabilize

It should display a list of the 29 kinds of graphs.

There are limitations and restrictions on the use of this. And please don't abuse this very nice free service.

Then there are lots of things about registering, signing in, saving, etc, etc. I do none of those. I just scrape the result and close the windows.

score 1 · Answer 3 · answered Aug 09 '17 at 18:12

I don't know if this is an answer to the question or not, but I just wanted to put this here in case someone is interested in enumerating all the connected cubic graphs with 20 vertices, listed in this paper.

The house of graphs has a large collection of graphs in the "Graph6" format, which is just a string identifier with a Wolfram Language importer. This page (which grabs some info from here) lists the cubic graph enumerations for different vertex count and minimum girth.

Since the file we want is a half million lines long, and each line contains exactly one graph object, I'll import it as a stream. This allows me to monitor the progress, and get around Import's problems with large files.

file = URLDownload["https://hog.grinvin.org/data/cubics/cub20.g6"];

stream = OpenRead[file];
n = 0;
graphs20 = Table[
    n++;
    ImportString[
     ReadLine@stream,
     "Graph6"
     ]
    , {510489}
    ];~Monitor~n (* using Monitor to keep track of the progress *)

The above code took about 10 minutes on my machine. You can verify that you the importing went as planned,

Length@graphs20
(* 510489 *)

Head /@ graphs20 // Union
(* {Graph} *)

You can do whatever you like with the graphs now,

RandomSample[graphs10K, 10]

You could use VertexDegree to verify that they are all indeed cubic graphs,

cubicGraphQ = SameQ[VertexDegree[#] // Union, {3}] &

and finally write them to an MX file to save time importing them later

Export["cubicGraphs20.mx", graphs20]

Note that the exporte MX file is almost 500MB while the "Graph6" source file is only 17MB.

Szabolcs · Answer 4 · 2020-02-10T09:35:51.490

What does GraphData["Cubic", n] do?

As its name implies, it returns results from a curated database. Importantly, it does not generate cubic graphs on 20 vertices. The list it returns is far from exhaustive (except for 7 or fewer vertices).

I'm trying to understand how many unique not-necessarily-connected cubic graphs on 20 vertices there are.

We can look it up in OEIS: there are 516344 such graphs.

OP asks in a comment:

how can I see, like, the first 100 of those 516344 cubic graphs

You can generate several random ones using IGDegreeSequenceGame in IGraph/M:

IGDegreeSequenceGame[ConstantArray[3, 20]]

or using the built-in DegreeGraphDistribution. Be careful with DegreeGraphDistribution as it doesn't report it when the input degree sequence is non-graphical, it doesn't sample uniformly, and neither of these two limitations are documented. See Does DegreeGraphDistribution sample uniformly?

What does GraphData["Cubic", n] do?

4 Answers4