Independence Polynomials of Bipartite Graphs

Bautista-Ramos, C., Guillen-Galvan, C., Gomez-Salgado, P.: Independence polynomials of Fibonacci trees are log-concave. Fibonacci Q. 58(1), 49–54 (2020)

Bautista-Ramos, C., Guillen-Galvan, C., Gomez-Salgado, P.: Log-concavity of some independence polynomials via a partial ordering. Discrete Math. 342(1), 18–28 (2019)

Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)

Brown, J.I., Cameron, B.: On the stability of independence polynomials. Electron. J. Comb. 25(1), 46 (2018)

Brown, J.I., Cameron, B.: On the unimodality of independence polynomials of very well-covered graphs. Discrete Math. 341(4), 1138–1143 (2018)

Brown, J.I., Dilcher, K., Karl, M., Dante, V.: On the roots of expected independence polynomials. J. Graph Theory 73(3), 322–326 (2013)

Csikvári, P.: Note on the smallest root of the independence polynomial. Comb. Probab. Comput. 22, 1–8 (2013)

Chudnovsky, M., Seymour, P.: The roots of the independence polynomial of a claw-free graph. J. Comb. Theory B 97, 350–357 (2007)

Cutler, J., Radcliffe, A.J.: Minimizing the number of independent sets in triangle-free regular graphs. Discrete Math. 341(3), 793–800 (2018)

Cutler, J., Pebody, L.: Maximal-clique partitions and the Roller Coaster Conjecture. J. Comb. Theory A 145, 25–35 (2017)

Dainyak, A.B.: On the number of independent sets in the trees of a fixed diameter. J. Appl. Ind. Math. 4(2), 163–171 (2010)

Dainyak, A.B., Sapozhenko, A.A.: Independent sets in graphs. Discrete Math. Appl. 26(6), 323–346 (2016)

Davies, E., Jenssen, M., Perkins, W., Roberts, B.: Independent sets, matchings, and occupancy fractions. J. Lond. Math. Soc. 96(2), 47–66 (2017)

Frendrup, A., Pedersen, A.S., Sapozhenko, A.A., Vestergaard, P.D.: Merrifield–Simmons index and minimum number of independent sets in short trees. ARS Comb. 111, 85–95 (2013)

Gutman, I.: An identity for the independence polynomials of trees. Publ. Inst. Math. 50(64), 19–23 (1991)

Gutman, I., Harary, F.: Generalizations of the matching polynomial. Util. Math. 24, 97–106 (1983)

Gutman, I., Radenković, S., Li, N., Li, S.C.: Extremal energy trees. MATCH Commun. Math. Comput. Chem. 59(2), 315–320 (2008)

Hoede, C., Li, X.: Clique polynomials and independant set polynomials of graphs. Discrete Math. 125, 219–228 (1994)

Hopkins, G., Staton, W.: Some identities arising from the Fibonacci numbers of certain graphs. Fibonacci Q. 22, 255–258 (1984)

Jing, W., Li, S.C.: The number of independent sets in bicyclic graphs. ARS Comb. 108, 465–479 (2013)

Levit, V.E., Madrescu, E.: The independence polynomial of a graph-A survey. In: Proceedings of the 1st International Conference on Algebraic Informatics, vol. 5, pp. 233–254 (2005)

Li, S.C., Liu, L., Wu, Y.Y.: On the coefficients of the independence polynomial of graphs. J. Comb. Optim. 33, 1324–1342 (2017)

Li, S.C., Li, X.C., Jing, W.: On the extremal Merrifield–Simmons index and Hosoya index of quasi-tree graphs. Discrete Appl. Math. 157(13), 2877–2885 (2009)

Li, S.C., Wang, S.J.: Further analysis on the total number of subtrees of trees. Electron. J. Comb. 19(4), #P48 (2012)

Li, S.C., Zhang, H.H., Zhang, M.J.: On the spectral moment of graphs with $$k$$ cut edges. Electron. J. Linear Algebra 26, 718–731 (2003)

Merrifield, R.E., Simmons, H.E.: The structure of molecular topological spaces. Theor. Chim. Acta 55, 55–75 (1980)

Oboudi, M.R.: Some results on the independence polynomial of unicyclic graphs. Discuss. Math. Graph Theory 38(2), 515–524 (2018)

Ostergard, P.R.J.: Constructing combinatorial objects via cliques. In: Webb, B.S. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 327, pp. 57–82. Cambridge Univ. Press, Cambridge (2005)

Pedersen, A.S., Vestergaard, P.D.: An upper bound on the number of independent sets in a tree. ARS Comb. 84, 85–96 (2007)

Pisanski, T., Žerovnik, J.: Edge-contributions of some topological indices and arboreality of molecular graphs. ARS Math. Contemp. 2, 49–58 (2009)

Prodinger, H., Tichy, R.H.: Fibonacci numbers of graphs. Fibonacci Q. 20, 16–21 (1982)

Ren, H.Z., Zhang, F.J.: Extremal double hexagonal chains with respect to $$k$$-matchings and $$k$$-independant sets. Discrete Appl. Math. 155, 2269–2281 (2007)

Song, L.Z., Staton, W., Wei, B.: Independence polynomials of $$k$$-tree related graphs. Discrete Appl. Math. 158, 943–950 (2010)

Trinks, M.: A survey on recurrence relations for the independence polynomial of hypergraphs. Graphs Comb. 32, 2145–2158 (2016)

Wagner, S., Gutman, I.: Maxima and minima of the Hosoya index and the Merrifield–Simmons index: a survey of results and techniques. Acta Appl. Math. 112(3), 323–346 (2010)

Wan, P.F., Tu, J.H., Zhang, S.G., Li, B.L.: Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. Appl. Math. Comput. 332, 42–47 (2018)

Zeng, Y.Q., Zhang, F.J.: Extremal polyomino chains on $$k$$-matchings and $$k$$-independent sets. J. Math. Chem. 42(2), 125–140 (2007)

Zhang, L.Z., Zhang, F.J.: Extremal hexagonal chains concerning $$k$$-matchings and $$k$$-independant sets. J. Math. Chem. 27(4), 319–329 (2000)

Zhao, Y.F.: The number of independent sets in a regular graph. Comb. Probab. Comput. 19, 315–320 (2010)

Zhu, B.X., Chen, Y.: Log-concavity of independence polynomials of some kinds of trees. Appl. Math. Comput. 342, 35–44 (2019)

Zhu, B.X., Lu, Q.L.: Unimodality of the independence polynomials of some composite graphs. Filomat 31(3), 629–637 (2017)

Zhu, B.X., Wang, Q.X.: Unimodality of independence polynomials of rooted products of graphs. Proc. R. Soc. Edinb. Sect. A Math. 150(5), 2573–2585 (2020)