In graph theory, an Andrásfai graph is a triangle-free, circulant graph named after Béla Andrásfai. == Properties == The Andrásfai graph And(n) for any natural number n ≥ 1 is a circulant graph on 3n − 1 vertices, in which vertex k is connected by an edge to vertices k ± j, for every j that is congruent to 1 mod 3.
In graph theory, an Andrásfai graph is a triangle-free, circulant graph named after Béla Andrásfai. == Properties == The Andrásfai graph And(n) for any natural number n ≥ 1 is a circulant graph on 3n − 1 vertices, in which vertex k is connected by an edge to vertices k ± j, for every j that is congruent to 1 mod 3.
Source: Wikipedia "Andrásfai graph" · CC BY-SA 4.0
Share this article: X · Bluesky