On the Partition Dimension and the Twin Number of a Graph
Document typeExternal research report
Rights accessOpen Access
A partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum cardinality of a locating partition of G . A pair of vertices u;v of a graph G are called twins if they have exactly the same set of neighbors other than u and v . A twin class is a maximal set of pairwise twin vertices. The twin number of a graph G is the maximum cardinality of a twin class of G . In this paper we undertake the study of the partition dimension of a graph by also considering its twin number. This approach allows us to obtain the set of connected graphs of order n 9 having partition dimension n
CitationHernando, M., Mora, M., Pelayo, I. M. "On the Partition Dimension and the Twin Number of a Graph". 2016.
URL other repositoryhttp://arxiv.org/pdf/1602.08907v3.pdf