The upper connected outer connected monophonic number of a graph

For a connected graph of order at least two, a connected outer connected monophonic set of is called a minimal connected outer connected monophonic set if no proper subset of is a connected outer connected monophonic set of . The upper connected outer connected monophonic number of is the maximum cardinality of a minimal connected outer connected monophonic set of . We determine bounds for it and find the upper connected outer connected monophonic number of certain classes of graphs. It is shown that for any two integers with , there is a connected graph of order with and . Also, for any three integers and with , there is a connected graph with and and a minimal connected outer connected monophonic set of cardinality , where is the connected outer connected monophonic number of a graph.