J(32,2,4) Generalized Johnson Graph

The Second DIMACS Implementation Challenge: 1992-1993

Originator: Panos Pardalos

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

A Johnson graph with parameters n, w, d has a node for every binary vector of length n with exactly w 1s. Two vertices are adjacent if and only if their hamming distance is at least d.

(70 vertices, 1855 edges)

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["J(32,2,4) Generalized Johnson Graph"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["J(32,2,4) Generalized Johnson Graph", All]["Summary"]
Out[2]=

Basic Applications

Find the maximum clique:

In[3]:=
g = ResourceData["J(32,2,4) Generalized Johnson Graph"];
In[4]:=
maxclique = FindClique[g]
Out[4]=

Show the maximum clique:

In[5]:=
HighlightGraph[g, Subgraph[g, maxclique], VertexCoordinates -> ReplacePart[
GraphEmbedding[g, "SpringElectricalEmbedding"], 
Thread[Map[VertexIndex[g, #]& , 
First[maxclique]] -> CirclePoints[{2.7, 0.9}, 0.6, 
Length[
First[maxclique]]]]], Sequence[
 EdgeStyle -> {Blank[] -> Opacity[0.05]}, GraphLayout -> "SpringElectricalEmbedding", VertexSize -> {Blank[] -> 0.5}]]
Out[12]=

Wolfram Research, "J(32,2,4) Generalized Johnson Graph" from the Wolfram Data Repository (2019)  

Data Resource History

Source Metadata

Data Downloads

Publisher Information