Edge Detour Monophonic Number of a Graph

• Santhakumaran, A. P. ^[1] ; Titus, P. ^[2] ; Ganesamoorthy, K. ^[3] ; Balakrishnan, P. ^[2]
  1. [1] Hindustan University

     Hindustan University

     India

     
  2. [2] University College of Engineering Nagercoil.
  3. [3] Anna University.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 32, Nº. 2, 2013, págs. 183-198
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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.