Re: A type of regular graph
From: David Eppstein (eppstein_at_ics.uci.edu)
Date: 10/30/04
- Previous message: Agustí Roig: "Re: monoidal enriched natural transformations"
- In reply to: Gene Ward Smith: "A type of regular graph"
- Messages sorted by: [ date ] [ thread ]
Date: Sat, 30 Oct 2004 22:30:05 +0000 (UTC)
In article <cluqqv$r6n$1@news.ks.uiuc.edu>,
genewardsmith@gmail.com (Gene Ward Smith) wrote:
> For a graph with verticies the integers mod n, we may draw an edge
> between a and b iff b=a+i for some i in a set of residues mod n.
> Clearly such a graph is a regular graph, is it possible to
> characterize it further with known graph-theoretic properties?
These graphs are known as circulants, e.g. see
<http://mathworld.wolfram.com/CirculantGraph.html>.
That doesn't answer your question, but it should at least help in
searching for an answer.
-- David Eppstein Computer Science Dept., Univ. of California, Irvine http://www.ics.uci.edu/~eppstein/
- Previous message: Agustí Roig: "Re: monoidal enriched natural transformations"
- In reply to: Gene Ward Smith: "A type of regular graph"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
|
