
arXiv: 1507.00881
In this paper the strong metric dimension of generalized Petersen graphs GP(n, 2) is considered. The exact value is determined for the cases n = 4k and n = 4k + 2, while for n = 4k + 1 an upper bound of the strong metric dimension is presented.
Connectivity, 05C12, 05C40, Distance in graphs, FOS: Mathematics, strong metric dimension, Mathematics - Combinatorics, Combinatorics (math.CO), generalized Petersen graphs
Connectivity, 05C12, 05C40, Distance in graphs, FOS: Mathematics, strong metric dimension, Mathematics - Combinatorics, Combinatorics (math.CO), generalized Petersen graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
