RT Journal Article
T1 The differential of the strong product graphs
A1 Bermudo Navarrete, Sergio
A1 De la Torre, L.
A1 Martín Caraballo, Ana M.
A1 Sigarreta, J.M.
K1 Differential
K1 Domination
K1 Strong product graphs
AB Let 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.
PB Taylor & Francis
SN 1124-1134
YR 2014
FD 2014-07-28
LK https://hdl.handle.net/10433/26273
UL https://hdl.handle.net/10433/26273
LA en
NO International Journal of Computer Mathematics, vol 92, nº 6 p. 1124-1134
NO Economía, Métodos Cuantitativos e Historia Económica
DS RIO
RD Jun 11, 2026