BabelNet

bn:01727907n

Noun Concept

Categories: Individual graphs, Strongly regular graphs, Regular graphs

Clebsch graph Greenwood-Gleason graph Greenwood–Gleason graph

In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with 80 edges. Wikipedia

Definitions

Relations

Sources

In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with 80 edges. Wikipedia

One of two different regular graphs with 16 vertices Wikidata

IS A

strongly regular graph

Hamiltonian path

Cayley graph

vertex-transitive graph

edge-transitive graph

+3 relations

HAS PARTS OF THE CLASS

vertex

edge

NAMED AFTER