1. Akbari, S., Alikhani, S., Peng, Yh: Characterization of graphs using domination polynomials. Eur. J. Comb. 31(7), 1714–1724 (2010)
2. Arocha, J.L., Llano, B.: Mean value for the matching and dominating polynomials. Discuss. Math. Graph Theory 20, 57–69 (2000)
3. Brouwer, A.E., Csorba, P., Schrijver, A.: The number of dominating sets of a finite graph is odd (2009). http://www.win.tue.nl/~aeb/preprints/domin4a.pdf
4. Brown, J.I., Nowakowski, R.J.: The neighbourhood polynomial of a graph. Aust. J. Comb. 42, 55–68 (2008)
5. Dod, M.: Domination in graphs with application to network reliability. Ph.D. thesis, TU Bergakademie Freiberg (2015). http://nbn-resolving.de/urn:nbn:de:bsz:105-qucosa-191146