Wolfram Research

Steiner Triple System A27 Graph

The Second DIMACS Implementation Challenge: 1992-1993

Originator: Carlo Mannino

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

Clique formulation of the Steiner Triple Problem, translated from the set covering formulation.

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["Steiner Triple System A27 Graph"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["Steiner Triple System A27 Graph", All]["Summary"]
Out[2]=

Basic Applications

Show the properties of the graph:

In[3]:=
g = ResourceData["Steiner Triple System A27 Graph"];
In[4]:=
Dataset[<|# -> #[g]|> & /@ {GraphDiameter, GraphDensity, 
   MeanGraphDistance, GraphLinkEfficiency}]
Out[4]=

Wolfram Research, "Steiner Triple System A27 Graph" from the Wolfram Data Repository (2019) 

Data Resource History

Source Metadata

Data Downloads

Publisher Information