Corona — корона.
2. Let denote the family of all maximum stable sets of the graph . We define as the set of vertices belonging to some maximum stable sets of .
3. is called the corona of graphs, if it is obtained from the disjoint union of and copies of (where ) by joining a vertex of with every vertex from -th copy of , for each .
Let be a fixed integer, , -corona is a graph obtained from copies of and copies of with appropriate edges between each vertex of the copy and all vertices of the copy of .
The -corona of a graph is a graph of order obtained from by attaching a path of length to each vertex so that the attached paths are vertex disjoint.
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.