Decomposition dimension of corona product of some classes of graphs

Abstract

For an ordered k-decomposition D = {G1, G2,...,Gk} of a connected graph G = (V,E), the D-representation of an edge e is the k-tuple γ(e/D)=(d(e, G1), d(e, G2), ...,d(e, Gk)), where d(e, Gi) represents the distance from e to Gi. A decomposition D is resolving if every two distinct edges of G have distinct representations. The minimum k for which G has a resolving k-decomposition is its decomposition dimension dec(G). In this paper, the decomposition dimension of corona product of the path Pn and cycle Cn with the complete graphs K1 and K2 are determined.