Read More
Date: 5-4-2022
![]()
Date: 2-3-2022
![]()
Date: 6-3-2022
![]() |
The clique covering number of a graph
is the minimum number of cliques in
needed to cover the vertex set of
. Since
involves the minimum number of cliques, only maximal cliques need be considered (since non-maximal cliques could not yield a clique cover of smaller size).
The clique covering number is also given by
where is the chromatic number of a graph
and
is the graph complement of
.
The clique covering number of some classes of graph are given by
graph |
|
complete |
|
complete graph |
1 |
cycle graph |
|
REFERENCES
West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, p. 226, 2000.
|
|
الصين.. طريقة لمنع تطور قصر النظر لدى تلاميذ المدارس
|
|
|
|
|
ماذا سيحدث خلال كسوف الشمس يوم السبت؟
|
|
|
|
|
قسم الشؤون الدينية يختتم محاضراته الرمضانية في صحن مرقد أبي الفضل العباس (عليه السلام)
|
|
|