1. Arora, S., Lund, C.: Hardness of approximations. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 399–446. PWS Publishing Company, Boston (1997)
2. Berge, C.: Graphs and Hypergraphs. North-Holland Publishing Co., Amsterdam, American Elsevier Publishing Co., Inc., New York, 1973, Translated from the French by Edward Minieka, North-Holland Mathematical Library, Vol. 6 (1973)
3. Böhme, T., Mohar, B.: Domination, packing and excluded minors. Electron. J. Combin. 10(9), 6 (2003). (electronic)
4. Bollobás, B., Cockayne, E.J.: Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3(3), 241–249 (1979)
5. Braga, R.O., Rodrigues, V.M., Trevisan, V.: On the distribution of Laplacian eigenvalues of trees. Discr. Math. 313(21), 2382–2389 (2013)