Metric dimension of ideal-intersection graph of the ring
Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n being a positive integer.
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2021-05-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/09728600.2021.1962700 |
Summary: | Metric Dimension of a simple connected graph is the minimum number of vertices those are used to identify each vertex of the graph uniquely using distance code. In this paper, we determine metric dimension of ideal-intersection graph for the ring where n being a positive integer. |
---|---|
ISSN: | 0972-8600 2543-3474 |