In this paper, for a connected graph G of order n, a set S of vertices of G is a split monophonic set if either S = V or S is a monophonic set and sub graph induced by V – S is disconnected. The split monophonic number ms(G) of a graph G is the minimum cardinality of a split monophonic set of G. For any integers such that, there exist a graph of order n with A graph with split monophonic number 2 is characterized. The split monophonic number of certain standard graphs is determined. For any integerswith, there exists a graph G such that and .
Volume 11 | 01-Special Issue
Pages: 697-701