Wolfram Research

H(6,4) Hamming Graph

The Second DIMACS Implementation Challenge: 1992-1993

Originator: Panos Pardalos

Examples

Basic Examples

Retrieve the graph:

In[1]:=
ResourceData["H(6,4) Hamming Graph"]
Out[1]=

Summary properties:

In[2]:=
ResourceData["H(6,4) Hamming Graph", All]["Summary"]
Out[2]=

Basic Applications

Find the maximum clique:

In[3]:=
g = ResourceData["H(6,4) Hamming 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[{3., 0.9}, 0.5, 
Length[
First[maxclique]]]]], Sequence[
 EdgeStyle -> {Blank[] -> Opacity[0.05]}, 
  GraphLayout -> "SpringElectricalEmbedding", 
  VertexSize -> {Blank[] -> 0.5}]]
Out[6]=

Wolfram Research, "H(6,4) Hamming Graph" from the Wolfram Data Repository (2019) 

Data Resource History

Source Metadata

Publisher Information