The Threshold Dimension and Irreducible Graphs

Let G be a graph, and let u, v, and w be vertices of G. If the distance between u and w does not equal the distance between v and w, then w is said to resolve u and v. The metric dimension of G, denoted β(G), is the cardinality of a smallest set W of vertices such that every pair of vertices of G is...

Full description

Bibliographic Details
Main Authors: Mol Lucas, Murphy Matthew J.H., Oellermann Ortrud R.
Format: Article
Language:English
Published: University of Zielona Góra 2023-02-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2359