Folkman graph
id:
folkman-graph-277-9793390
title:
Folkman graph
text:
In the mathematical field of graph theory, the Folkman graph is a 4-regular graph with 20 vertices and 40 edges. It is a regular bipartite graph with symmetries taking every edge to every other edge, but the two sides of its bipartition are not symmetric with each other, making it the smallest possible semi-symmetric graph. It is named after Jon Folkman, who constructed it for this property in 1967. The Folkman graph can be constructed either using modular arithmetic or as the subdivided double
brand slug:
wiki
category slug:
encyclopedia
description:
Bipartite 4-regular graph with 20 nodes and 40 edges
original url:
https://en.wikipedia.org/wiki/Folkman_graph
date created:
date modified:
2024-04-15T05:03:53Z
main entity:
{"identifier":"Q3115489","url":"https://www.wikidata.org/entity/Q3115489"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/ad/Folkman_graph_alt.svg","width":540,"height":545}
fields total:
13
integrity:
15