Wolfram Research

5-Fat Ring Graph with 200 vertices

The Second DIMACS Implementation Challenge: 1992-1993

NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability, The Second DIMACS Implementation Challenge: 1992-1993

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["5-Fat Ring Graph with 200 vertices"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["5-Fat Ring Graph with 200 vertices", All]["Summary"]
Out[2]=

Basic Applications

Find the maximum clique:

In[3]:=
g = ResourceData["5-Fat Ring Graph with 200 vertices"];
In[4]:=
maxclique = FindClique[g]
Out[4]=

Show the properties of the graph:

In[5]:=
Dataset[<|# -> #[g]|> & /@ {GraphDiameter, GraphDensity, MeanGraphDistance, GraphLinkEfficiency}]
Out[5]=

Wolfram Research, "5-Fat Ring Graph with 200 vertices" from the Wolfram Data Repository (2019) 

Data Resource History

Source Metadata

Data Downloads

Publisher Information