The resolving number of a graph Delia - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

The resolving number of a graph Delia


We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by Chartrand, Poisson and Zhang. First, we establish an important difference between the two parameters: while computing the metric dimension of an arbitrary graph is known to be NP-hard, we show that the resolving number can be computed in polynomial time. We then relate the resolving number to classical graph parameters: diameter, girth, clique number, order and maximum degree. With these relations in hand, we characterize the graphs with resolving number 3 extending other studies that provide characterizations for smaller resolving number.
Fichier principal
Vignette du fichier
2505-8469-1-PB.pdf (187.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00966384 , version 1 (26-03-2014)



Delia Garijo, Antonio González, Alberto Márquez. The resolving number of a graph Delia. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 3 (3), pp.155-166. ⟨10.46298/dmtcs.615⟩. ⟨hal-00966384⟩


78 View
838 Download



Gmail Facebook X LinkedIn More