Clique polynomials of $2$-connected $K_{5}$-free chordal graphs
DOI:
https://doi.org/10.13069/jacodesmath.863113Keywords:
Chordal graphs, Clique polynomials, Clique roots, Clique valueAbstract
In this paper, we give a generalization of the author's previous result about real rootedness of clique polynomials of connected $K_{4}$-free chordal graphs to the class of $2$-connected $K_{5}$-free chordal graphs. The main idea is based on the graph-theoretical interpretation of the second derivative of clique polynomials. Finally, we conclude the paper with several interesting open questions and conjectures.
Received: 23 January 2020 | Accepted: 13 September 2020Downloads
References
J. A. Bondy and U. S. R. Murty, Graph Theory, Graduate Texts in Mathematics, vol. 244, Springer, New York (2008).
P. Brändén, Unimodality, log-concavity, real-rootedness and beyond, in: Handbook of Enumerative Combinatorics, CRC Press (2015) 437–483.
L. Comtet, Advanced Combinatorics: The Art of Finite and Infinite Expansions, D. Reidel Publishing Co., Dordrecht-Boston (1974).
H. Hajiabolhassan and M. L. Mehrabadi, On clique polynomials, Australas. J. Combin. 18 (1998) 313–316.
P. Haxell, A. Kostochka, and S. Thomassé, Packing and covering triangles in $K_4$-free planar graphs, Discrete Appl. Math. 160(6) (2012) 723–730.
X. Li and I. Gutman, A unified approach to the first derivatives of graph polynomials, Discrete Appl. Math. 58(3) (1995) 293–297.
T. A. McKee and F. R. McMorris, Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia (1999).
H. Teimoori, Clique roots of $K_4$-free chordal graphs, Electron. J. Graph Theory Appl. 7(1) (2019) 105–111.
A. A. Zykov, On some properties of linear complexes, Mat. Sbornik N.S. 24(66)(2) (1949) 163–188.
