Optimization · 2013 · 29 citations · 6 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsSet TheoryCombinatorial Set TheoryEnumerative CombinatoricsGraph AlgorithmsGraph TheorySet Cardinality
Abstract In this paper, we consider the problem of determining the minimal cardinality of double resolving sets for prism graphs . It is proved that the minimal cardinality is equal to four if is even and equal to three if is odd.
6
Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld · Discrete Applied Mathematics · 1996 · 808 citations
On the Metric Dimension of Cartesian Products of Graphs
José Cáceres, Carmen Hernando, Mercè Ferrater Mora et al. · SIAM Journal on Discrete Mathematics · 2007 · 474 citations · Full text