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


This is a subgraph \,G[W] induced by W \subseteq V(G) such that every pair of vertices is adjacent. The clique size of a clique \,G[W] is the number of vertices of \,W. The maximum clique size of a clique in \,G, \,\omega(G), is called the clique number of \,G. The clique number \,\Omega(G,w) of a weighted graph is defined as the minimum weight of a clique in \,G.


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