Graphs of neighborhood metric dimension two
A subset S of vertices of a simple connected graph is a neighborhood set (n-set) of G if G is the union of subgraphs of Ginduced by the closed neighbors of elements in S. Further, a set S is a resolving set of G if for each pair of distinct vertices x, y of G, there is a vertex (formula presented) s...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Research and Community Services, Institut Teknologi Bandung
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |