Assertion: graph's set | /r/HasProperty | single chosen vertex
Facets:
Source sentences:
text: In the set cover problem formed from a metric dimension problem, the elements to be covered are the ( n 2 ) {\displaystyle {\tbinom {n}{2}}} pairs of vertices to be distinguished, and the sets that can cover them are the sets of pairs that can be distinguished by a single chosen vertex.