Graph Operations and Point-Distinguishing Chromatic Indices

Abstract

The point-distinguishing chromatic index of a graph \(G = (V, E)\) is the smallest number of colors assigned to \(E\) so that no two different points are incident with the same color set. In this paper, we discuss the bounds of the point-distinguishing chromatic indices of graphs resulting from the graph operations. We emphasize that almost all of these bounds are best possible.