Monophonic graphoidal covering number of corona product graphs

Abstract

In a graph G, a chordless path is called a monophonic path. A collection ψm of monophonic paths in G is called a monophonic graphoidal cover of G if every vertex of G is an internal vertex of at most one monophonic path in ψm and every edge of G is in exactly one monophonic path in ψm. The monophonic graphoidal covering number ηm(G) of G is the minimum cardinality of a monophonic graphoidal cover of G. In this paper, we find the monophonic graphoidal covering number of corona product of some standard graphs.