Isometric Path Partition Number of Corona Product of Graphs

Abstract

The collection of isometric paths that partition the vertex set of a graph G is an isometric path partition of G. The minimum cardinality of an isometric path partition is called the isometric path partition number of G. In this paper, we computed an upper bound for the isometric path partition number of corona product of G ʘ H and investigate the isometric path partition number of corona product of G with path, cycle,  complete graph and ladder graph