The Upper Bound of Metric Dimension of Bridge Graphs

DOI

10.2991/assehr.k.200827.002How to use a DOI?

Keywords

bridge graph, metric dimension, caterpillar, cycle graph

Abstract

The metric dimension is one of the problems in graph theory which is interesting to study until now. The metric dimension has many applications such as image processing. However, not all graphs have been obtained for the metric dimensions such as a bridge graph. A bridge graph is a graph obtained from two connected graphs G1, G2 with adding a new edge uv where u in G1 dan v in G2. A bridge graph is a new graph which has a larger order than the previous graph G1 or G2. Therefore, the subdivision graph metric dimension can be obtained from the metric dimension before subdivision. Metric dimension of bridge graph can be determined by analysis of structure and analysis of the distance between vertices. This article shows the upper bound of a bridge graph from two connected graphs. In addition, this paper shows metric dimension the bridge graphs which obtained from the caterpillar and cycle graph.

Copyright

© 2020, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Amrullah Amrullah
AU  - Baidowi Baidowi
AU  - Syahrul Azmi
AU  - Nani Kurniati
AU  - Turmuzi Turmuzi
PY  - 2020
DA  - 2020/08/28
TI  - The Upper Bound of Metric Dimension of Bridge Graphs
BT  - Proceedings of the 1st Annual Conference on Education and Social Sciences (ACCESS 2019)
PB  - Atlantis Press
SP  - 4
EP  - 8
SN  - 2352-5398
UR  - https://doi.org/10.2991/assehr.k.200827.002
DO  - 10.2991/assehr.k.200827.002
ID  - Amrullah2020
ER  -