User:Porphyro/sandbox

The "Andrásfai graph" is a triangle free graph on $$3n-1$$ vertices, named after Béla Andrásfai.

Properties
The  Andrásfai-graph  for any natural number $$ n \geq 1 $$ is a circulant graph on $$3n-1$$ vertices, in which vertex $k$ is connected by an edge to vertices $$k\pm j$$, where $$j=1 \mod 3$$.

The graph family is triangle-free, and $$And(n)$$ has an independence number of $$n$$.

Related Items

 * Petersen graph
 * Cayley Graph

Category:Parametric families of graphs Category:Regular graphs