Connected closed monophonic number of graphs
Abstract
In this paper the concept of connected closed monophonic number of a graph is introduced. Let G be a connected graph and is called closed monophonic cover of if 1, 2, 3… k} is obtained by choosing the vertices on the following way. (i) 1 2. (ii) i ? i-1] for and (iii) k where i 1, 2, 3… i} for all . A set of vertices of a graph is connected closed monophonic cover, if it is closed monophonic cover and the induced sub graph is connected. Connected closed monophonic number of some general graphs such as n, n, complete graph p, bipartite graph m, n and non-trivial tree are derived.