On the Strong Partition Dimension of Graphs

Abstract

We present a new style of metric generator in graphs. Specifically we introduce a metric generator based on a partition of the vertex set of a graph. The sets of the partition will work as the elements which will uniquely determine the position of each single vertex of the graph. A set W of vertices of a connected graph G strongly resolves two different… (More)

Topics

1 Figure or Table

Slides referencing similar topics