The resolving number of a graph
From MaRDI portal
Publication:5747415
zbMath1283.05077arXiv1309.0252MaRDI QIDQ5747415
Delia Garijo, Antonio González, Alberto Márquez
Publication date: 14 February 2014
Full work available at URL: https://arxiv.org/abs/1309.0252
Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
This page was built for publication: The resolving number of a graph