Affordable Access

Access to the full text

Characterization of n-Vertex Graphs of Metric Dimension n − 3 by Metric Matrix

Authors
  • wang, juan
  • miao, lianying
  • liu, yunlong
Publication Date
May 27, 2019
Identifiers
DOI: 10.3390/math7050479
OAI: oai:mdpi.com:/2227-7390/7/5/479/
Source
MDPI
Keywords
Language
English
License
Green
External links

Abstract

Let G = ( V ( G ) , E ( G ) ) be a connected graph. An ordered set W &sub / V ( G ) is a resolving set for G if every vertex of G is uniquely determined by its vector of distances to the vertices in W. The metric dimension of G is the minimum cardinality of a resolving set. In this paper, we characterize the graphs of metric dimension n &minus / 3 by constructing a special distance matrix, called metric matrix. The metric matrix makes it so a class of graph and its twin graph are bijective and the class of graph is obtained from its twin graph, so it provides a basis for the extension of graphs with respect to metric dimension. Further, the metric matrix gives a new idea of the characterization of extremal graphs based on metric dimension.

Report this publication

Statistics

Seen <100 times