Crown of graphs

Материал из WikiGrapp
Перейти к:навигация, поиск

Crown of graphsкорона графов.

For positive integers k \leq n, the crown of graphs C_{n,k} is a graph with a vertex set \{a_{1}, \ldots, a_{n}, b_{1}, \ldots, b_{n}\} and an edge set \{a_{i}b_{j}: \; 1 \leq i \leq n, j = i+1, i+2, \ldots,i+k\pmod{n}\}. For any positive integer \lambda, let \lambda C_{n,k} denote a multiple graph obtained from the crown C_{n,k} by replacing each edge e by \lambda edges with the same end vertices as those of e. We call \lambda C_{n,k} a multicrown.

See also


  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.