Extremal graph theory for metric dimension and diameter

From MaRDI portal
Publication:2380462

zbMATH Open1219.05051arXiv0705.0938MaRDI QIDQ2380462FDOQ2380462

David R. Wood, I. M. Pelayo, C. Hernando, Carlos Seara, Mercè Mora

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: A set of vertices S emph{resolves} a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The emph{metric dimension} of G is the minimum cardinality of a resolving set of G. Let be the set of graphs with metric dimension and diameter D. It is well-known that the minimum order of a graph in is exactly . The first contribution of this paper is to characterise the graphs in with order for all values of and D. Such a characterisation was previously only known for Dleq2 or . The second contribution is to determine the maximum order of a graph in for all values of D and . Only a weak upper bound was previously known.


Full work available at URL: https://arxiv.org/abs/0705.0938

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)






Cited In (80)


Recommendations





This page was built for publication: Extremal graph theory for metric dimension and diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380462)