The connected detour monophonic number of a graph
Citation
Titus, P., Santhakumaran, A. P. & Ganesamoorthy, K. (2016). The connected detour monophonic number of a graph. TWMS Journal of Applied and Engineering Mathematics, 6(1), 7586.Abstract
For a connected graph G = (V, E) of order at least two, a chord of a path P is an edge joining two nonadjacent vertices of P. A path P is called a monophonic path if it is a chordless path. A longest x ? y monophonic path is called an x ? y detour monophonic path. A set S of vertices of G is a detour monophonic set of G if each vertex v of G lies on an x ? y detour monophonic path, for some x and y in S. The minimum cardinality of a detour monophonic set of G is the detour monophonic number of G and is denoted by dm(G). A connected detour monophonic set of G is a detour monophonic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected detour monophonic set of G is the connected detour monophonic number of G and is denoted by dmc(G). We determine bounds for dmc(G) and characterize graphs which realize these bounds. It is shown that for positive integers r, d and k ? 6 with r < d, there exists a connected graph G with monophonic radius r, monophonic diameter d and dmc(G) = k. For each triple a, b, p of integers with 3 ? a ? b ? p ? 2, there is a connected graph G of order p, dm(G) = a and dmc(G) = b. Also, for every pair a, b of positive integers with 3 ? a ? b, there is a connected graph G with mc(G) = a and dmc(G) = b, where mc(G) is the connected monophonic number of G.
Volume
6Issue
1URI
https://hdl.handle.net/11729/2580http://jaem.isikun.edu.tr/web/index.php/archive/91vol6no1/236
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.

On the monophonic and monophonic domination polynomial of a graph
Sudhahar, Arul Paul; Jebi, W. (Işık University Press, 202401)A set S of vertices of a graph G is a monophonic set of G if each vertex u of G lies on an u ? v monophonic path in G for some u, v ? S. M ? V (G) is said to be a monophonic dominating set if it is both a monophonic set ... 
Minimal restrained monophonic sets in graphs
Santhakumaran, A. P.; Raghu T. Venkata; Ganesamoorthy, K. (Işık University Press, 2021)For a connected graph G = (V, E) of order at least two, a restrained monophonic set S of a graph G is a monophonic set such that either S = V or the subgraph induced by V ?S has no isolated vertices. The minimum cardinality ... 
On the connected detour monophonic number of a graph
Titus, Pritty; Ganesamoorthy, Kathiresan (Işık University Press, 2021)For a connected graph G = (V, E) of order at least two, a connected detour monophonic set S of G is called a minimal connected detour monophonic set if no proper subset of S is a connected detour monophonic set of G. The ...