Bermudo Navarrete, SergioDe la Torre, L.Martín Caraballo, Ana M.Sigarreta, J.M.2026-02-262026-02-262014-07-28International Journal of Computer Mathematics, vol 92, nº 6 p. 1124-11341124-113410.1080/00207160.2014.941359https://hdl.handle.net/10433/26273Let G = (V, E) be a graph of order n and let B(D) be the set of vertices in V \ D that have a neighbour in the set D. The differential of a set D is defined as ∂(D) = |B(D)| − |D| and the differential of a graph to equal the maximum value of ∂(D) for any subset D of V. In this paper we obtain several tight bounds for the differential of strong product graphs. In particular, we investigate the relationship between the differential of this type of product graphs and various parameters in the factors of the product.application/pdfenAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/DifferentialDominationStrong product graphsjournal articlerestricted access