摘要 : The strong resolving graph G(SR) of a connected graph G was introduced by Oellermann and Peters-Fransen (2007) as a tool to study the strong metric dimension of G. Recently, Kuziak et al. (2018) studied the realization and charact... 展开 The strong resolving graph G(SR) of a connected graph G was introduced by Oellermann and Peters-Fransen (2007) as a tool to study the strong metric dimension of G. Recently, Kuziak et al. (2018) studied the realization and characterization problems of strong resolving graphs and they pose a conjecture: The graph equation G(SR) congruent to K-r,K-s has no solution for any r, s >= 2. In this paper we give a positive answer to this conjecture. (C) 2019 Elsevier B.V. All rights reserved. 收起