The Grünbaum-Rigby graph is the term used in this work for the Levi graph of the Grünbaum-Rigby configuration. This graph has 42 vertices and 84 edges and is illustrated above in a number of LCF embeddings.
It is implemented in the Wolfram Language as GraphData["GruenbaumRigbyGraph"].