Extremal graph theory for metric dimension and diameter
Visualitza/Obre
Tipus de documentArticle
Data publicació2010-02-22
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
A set of vertices S resolves a connected graph G if every vertex is uniquely
determined by its vector of distances to the vertices in S. The metric dimension of
G is the minimum cardinality of a resolving set of G. Let G ,D be the set of graphs
with metric dimension and diameter D. It is well-known that the minimum order
of a graph in G ,D is exactly + D. The first contribution of this paper is to
characterise the graphs in G ,D with order + D for all values of and D. Such
a characterisation was previously only known for D 6 2 or 6 1. The second
contribution is to determine the maximum order of a graph in G ,D for all values of
D and . Only a weak upper bound was previously known.
CitacióHernando, M. [et al.]. Extremal graph theory for metric dimension and diameter. "Electronic journal of combinatorics", 22 Febrer 2010, vol. 17, núm. R30, p. 1-28.
ISSN1077-8926
Versió de l'editorhttp://www.combinatorics.org/Volume_17/PDF/v17i1r30.pdf
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
extremal.pdf | 628,9Kb | Visualitza/Obre |