Keywords

#circulant_graph

Circulant graph

Undirected graph acted on by a vertex-transitive cyclic group of symmetries

In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes called a cyclic graph, but this term has other meanings.

Wed 14th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Circulant graph Circulant matrix Regular graph Cycle graph Cyclic graph Cyclic group Cyclic (mathematics) Graph isomorphism problem Symmetric graph Rado graph
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.