Loading...
Please wait, while we are loading the content...
Similar Documents
Graphs With Metric Dimension Two - A Characterization
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sudhakara, G. Hemanth Kumar A. R. |
| Copyright Year | 2009 |
| Abstract | In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever We also find a bound for cardinality of any distance partite set with reference to a given vertex, whenever Also, in a graph G with a bound for cardinality of any distance partite set as well as a bound for number of vertices in any subgraph H of G is obtained in terms of diam H. |
| Starting Page | 1128 |
| Ending Page | 1133 |
| Page Count | 6 |
| File Format | PDF HTM / HTML |
| Volume Number | 3 |
| Alternate Webpage(s) | http://www.waset.org/journals/waset/v60/v60-104.pdf |
| Alternate Webpage(s) | http://waset.org/publications/13897/graphs-with-metric-dimension-two-a-characterization |
| Alternate Webpage(s) | https://waset.org/publications/13897/graphs-with-metric-dimension-two-a-characterization |
| Alternate Webpage(s) | http://www.waset.org/journals/waset/v36/v36-104.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
