Monophonic numbers of the join and composition of connected graphs

@article{Paluga2007MonophonicNO,
title={Monophonic numbers of the join and composition of connected graphs},
author={E. M. Paluga and Sergio R. Canoy},
journal={Discret. Math.},
year={2007},
volume={307},
pages={1146-1154}
}

In this paper, we describe the monophonic sets in the join and composition of two connected graphs. We also determine the monophonic numbers of the join of any two connected graphs and the composition G[K"n] of a connected graph G and the complete graph K"n. Lower and upper bounds are obtained for the monophonic number of the composition G[H], where G is connected and H is a connected non-complete graph.