Read More
Date: 18-5-2022
1494
Date: 19-3-2022
1596
Date: 3-8-2016
1654
|
The clique polynomial for the graph is defined as the polynomial
(1) |
where is the clique number of , the coefficient of for is the number of cliques in a graph with vertices, and the constant term is 1 (Hoede and Li 1994, Hajiabolhassan and Mehrabadi 1998). Hajiabolhassan and Mehrabadi (1998) showed that always has a real root.
The coefficient is the vertex count, is the edge count, and is the triangle count in a graph.
is related to the independence polynomial by
(2) |
where denotes the graph complement (Hoede and Li 1994).
This polynomial is similar to the dependence polynomial defined as
(3) |
(Fisher and Solow 1990), with the two being related by
(4) |
The following table summarizes clique polynomials for some common classes of graphs.
graph | |
Andrásfai graph | |
antiprism graph | |
barbell graph | |
book graph | |
cocktail party graph | |
complete bipartite graph | |
complete graph | |
complete tripartite graph | |
crossed prism graph | |
crown graph | |
cycle graph | |
empty graph | |
folded cube graph | |
gear graph | |
grid graph | |
grid graph | |
helm graph | |
hypercube graph | |
-king graph | |
-knight graph | |
ladder graph | |
ladder rung graph | |
Möbius ladder | |
path graph | |
prism graph | |
star graph | |
sun graph | |
sunlet graph | |
transposition graph | |
triangular grid graph | |
web graph for | |
wheel graph |
The following table summarizes the recurrence relations for clique polynomials for some simple classes of graphs.
graph | order | recurrence |
Andrásfai graph | 4 | |
barbell graph | 2 | |
book graph | 2 | |
cocktail party graph | 1 | |
complete bipartite graph | 3 | |
complete graph | 1 | |
-crossed prism graph | 2 | |
crown graph | 3 | |
cycle graph for | 2 | |
empty graph | 2 | |
folded cube graph | 3 | |
gear graph | 2 | |
grid graph | 3 | |
grid graph | 4 | |
hypercube graph | 3 | |
-king graph | 3 | |
-knight graph | 3 | |
ladder graph | 2 | |
ladder rung graph | 2 | |
Möbius ladder | 2 | |
path graph | 2 | |
prism graph | 2 | |
star graph | 2 | |
sun graph | 3 | |
sunlet graph | 2 | |
triangular grid graph | 3 | |
wheel graph | 2 |
Fisher, D. C. and Solow, A. E. "Dependence Polynomials." Disc. Math. 82, 251-258, 1990.
Goldwurm, M. and Santini, M. "Clique Polynomials Have a Unique Root of Smallest Modulus." Informat. Proc. Lett. 75, 127-132, 2000.
Hajiabolhassan, H. and Mehrabadi, M. L. "On Clique Polynomials." Australas. J. Combin. 18, 313-316, 1998.
Hoede, C. and Li, X. "Clique Polynomials and Independent Set Polynomials of Graphs." Discr. Math. 125, 219-228, 1994.
Levit, V. E. and Mandrescu, E. "The Independence Polynomial of a Graph--A Survey." In Proceedings of the 1st International Conference on Algebraic Informatics. Held in Thessaloniki, October 20-23, 2005
(Ed. S. Bozapalidis, A. Kalampakas, and G. Rahonis). Thessaloniki, Greece: Aristotle Univ., pp. 233-254, 2005.
|
|
مخاطر عدم علاج ارتفاع ضغط الدم
|
|
|
|
|
اختراق جديد في علاج سرطان البروستات العدواني
|
|
|
|
|
مدرسة دار العلم.. صرح علميّ متميز في كربلاء لنشر علوم أهل البيت (عليهم السلام)
|
|
|