Edge Detour Monophonic Number of a Graph
Author
Santhakumaran, A. P.
Titus, P.
Ganesamoorthy, K.
Balakrishnan, P.
Abstract
For a connected graph G of order at least two, an edge detour monophonic set of G is a set S of vertices such that every edge of G lies on a detour monophonic path joining some pair of vertices in S. The edge detour monophonic number of G is the minimum cardinality of its edge detour monophonic sets and is denoted by edm(G) .We determine bounds for it and characterize graphs which realize these bounds. Also, certain general properties satisfied by an edge detour monophonic set are studied. It is shown that for positive integers a, b and c with 2 < a < b < c, there exists a connected graph G such that m(G) = a, m!(G) = b and edm(G) = c,where m(G) is the monophonic number and m! (G) is the edge monophonic number of G. Also, for any integers a and b with 2 < a < b, there exists a connected graph G such that dm(G) = a and edm(G)= b,where dm(G) is the detour monophonic number of a graph G.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Upper double monophonic number of a graph.
Santhakumaran, A. P.; Venkata Raghu, T.. Proyecciones. Journal of Mathematics; Vol 37 No 2 (2018); 295-304 -
Edge-to-vertex m-detour monophonic number of a graph.
Santhakumaran, A. P.; Titus, P.; Ganesamoorthy, K.. Proyecciones. Journal of Mathematics; Vol 37 No 3 (2018); 415-428 -
Upper Edge Detour Monophonic Number of a Graph
Titus, P.; Ganesamoorthy, K.. Proyecciones. Journal of Mathematics; Vol 33 No 2 (2014); 175-187