Dejter graph
id:
dejter-graph-285-2321557
title:
Dejter graph
text:
In the mathematical field of graph theory, the Dejter graph is a 6-regular graph with 112 vertices and 336 edges. The Dejter graph is
obtained by deleting a copy
of the Hamming code of length 7 from the binary
7-cube. The Dejter graph, and by extension any graph obtained by deleting a Hamming code of length 2r-1 from a
(2r-1)-cube, is a symmetric graph.
In particular, the Dejter graph admits a 3-factorization into two
copies of the Ljubljana graph, which is the third smallest existing semi-symme
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Dejter_graph
date created:
date modified:
2022-08-29T13:03:06Z
main entity:
{"identifier":"Q17010156","url":"https://www.wikidata.org/entity/Q17010156"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/45/Dejter-Heawood4.pdf","width":1275,"height":1650}
fields total:
13
integrity:
14