Abstract
Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n, which provides an infinite family of counterexamples to the characterization. Furthermore, we find exact values of the metric, edge metric, mixed-metric dimensions, the domination number, locating-dominating number, and metric-locating-dominating number for the complete multipartite graphs. These results generalize various results in the literature from complete bipartite to complete multipartite graphs.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference58 articles.
1. Leaves of trees;Slater;Congress. Numer.,1975
2. On the metric dimension of a graph;Harary;Ars Combin.,1976
3. Distances in Graphs;Buckley,1990
4. The theory and applications of resolvability in graphs: A survey;Chartrand;Congress. Numer.,2003
5. Landmarks in graphs
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献