| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652946 | Electronic Notes in Discrete Mathematics | 2007 | 5 Pages |
Abstract
Let Gβ,D be the set of graphs with metric dimension β and diameter D. The first contribution is to characterize the graphs in Gβ,D with order β+D for all values of β and D. 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
