References
- L.A. Basilio, S. Bermudo, and J.M. Sigarreta, Bounds on the differential of a graph, Util. Math., to appear.
- S. Bermudo and H. Fernau, Lower bound on the differential of a graph, Discrete Math. 312 (2012), pp. 3236–3250. doi: 10.1016/j.disc.2012.07.021
- S. Bermudo and H. Fernau, Computing the differential of a graph: Hardness, approximability and exact algorithms, Discrete Appl. Math. 165 (2014), pp. 69–82. doi: 10.1016/j.dam.2012.11.013
- S. Bermudo and H. Fernau, Combinatorics for smaller kernels: The differential of a graph, Theoret. Comput. Sci., to appear.
- S. Bermudo, J.M. Rodríguez, and J.M. Sigarreta, On the differential in graphs, Util. Math., to appear.
- R.M. Casablanca, A. Diánez, and P. García-Vázquez, Toughness of the corona of two graphs. Int. J. Comput. Math. 88(13) (2011), pp. 2697–2706. doi: 10.1080/00207160.2011.564277
- W. Dörfler and W. Imrich, Über das starke Produkt von endlichen Graphen, Österreih. Akad. Wiss., Math.-Natur. Kl., S.-B. II 178 (1969), pp. 247–262.
- J.F. Fink, M.S. Jacobson, L.F. Kinch, and J. Roberts, On graphs having domination number half their order, Period. Math. Hungar. 16(4) (1985), pp. 287–293. doi: 10.1007/BF01848079
- R. Frucht and F. Harary, On the corona of two graphs, Aequationes Math. 4 (1970), pp. 322–325. doi: 10.1007/BF01844162
- W. Goddard and M.A. Henning, Generalised domination and independence in graphs, Congr. Numer. 123 (1997), pp. 161–171.
- T.W. Haynes, S. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
- T.W. Haynes, S. Hedetniemi, and P.J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
- W. Imrich and S. Klavzar, Product Graphs: Structure and Recognition. Wiley-Interscience, New York, 2000.
- D. Kempe, J. Kleinberg, and E. Tardos, Maximizing the spread of influence through a social network, KDD’03: Proceedings of the Ninth ACM SIGKDD international conference on Knowledge Discovery and Data Mining, New York, 2003, pp. 137–146.
- D. Kempe, J. Kleinberg, and E. Tardos, Influential nodes in a diffusion model for social networks, ICALP (Springer-Verlag), 2005, pp. 1127–1138.
- J.R. Lewis, Differentials of graphs, Master's thesis, East Tennessee State University, 2004.
- J.L. Mashburn, T.W. Haynes, S.M. Hedetniemi, S.T. Hedetniemi, and P.J. Slater, Differentials in graphs, Util. Math. 69 (2006), pp. 43–54.
- W. McCuaig and B. Shepherd, Domination in graphs with minimum degree two, J. Graph Theory 13(6) (1989), pp. 749–762. doi: 10.1002/jgt.3190130610
- P. Roushini Leely Pushpam and D. Yokesh, Differential in certain classes of graphs, Tamkang J. Math. 41(2) (2010), pp. 129–138.
- C.E. Shannon, The zero-error capacity of a noisy channel, IRE Trans. Inform. Theory 2(3) (1956), pp. 8–19. doi: 10.1109/TIT.1956.1056798
- J.M. Sigarreta, Differential in cartesian product graphs, Ars Combin., to appear.
- P.J. Slater, Enclaveless sets and MK-systems, J. Res. Nat. Bur. Standards 82(3) (1977), pp. 197–202. doi: 10.6028/jres.082.019
- I.G. Yero and J.A. Rodríguez-Velázquez, On the randić index of corona product graphs, ISRN Discrete Math. 2011 (2011), Article ID 262183 (7 pp). Available at http://www.hindawi.com/journals/isrn.discrete.mathematics/2011/262183/
- C.Q. Zhang, Finding critical independent sets and critical vertex subsets are polynomial problems, SIAM J. Discrete Math. 3(3) (1990), pp. 431–438. doi: 10.1137/0403037