SciELO - Scientific Electronic Library Online

vol.37 issue3Multiple solutions of stationary Boltzmann equationProperly efficient solutions to non-differentiable multiobjective optimization problems author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google


Proyecciones (Antofagasta)

Print version ISSN 0716-0917

Proyecciones (Antofagasta) vol.37 no.3 Antofagasta Sept. 2018 


Edge-to-vertex m-detour monophonic number of a graph

A. P. Santhakumaran1 

P. Titus2 

K. Ganesamoorthy3 

1Hindustan Institute of Technology and Science, Department of Mathematics, Chennai - 603 103, India e-mail :

2Anna University, University College of Engineering Nagercoil, Department of Mathematics, Tirunelveli Region Nagercoil - 629 004, India e-mail:

3Coimbatore Institute of Technology, Government Aided Autonomous Institution, Department of Mathematics, Coimbatore - 641 014, India e-mail:


For a connected graph G = (V, E) of order at least three, the monophonic distance dm(u, v) is the length of a longest u − v monophonic path in G. A u − v path of length dm(u, v) is called a u − v detour monophonic. For subsets A and B of V, the m-monophonic distance Dm(A, B) is defined as Dm(A, B) = max{dm(x, y) : x ∈ A, y ∈ B}. A u − v path of length Dm(A, B) is called a A − B m-detour monophonic path joining the sets A, B ⊆ V, where u ∈ A and v ∈ B. A set S ⊆ E is called an edge-to-vertex m-detour monophonic set of G if every vertex of G is incident with an edge of S or lies on a m-detour monophonic path joining a pair of edges of S. The edge-to-vertex mdetour monophonic number Dmev(G) of G is the minimum order of its edge-to-vertex m-detour monophonic sets and any edge-to-vertex m-detour monophonic set of order Dmev(G) is an edge-to-vertex mdetour monophonic basis of G. Some general properties satisfied by this parameter are studied. The edge-to-vertex m-detour monophonic number of certain classes of graphs are determined. It is shown that for positive integers r, d and k ≥ 4 with r < d, there exists a connected graph G such that radm(G) = r, diamm(G) = d and Dmev(G) = k.

Key Words: monophonic distance; m-detour monophonic path; edge-to-vertex m-detour monophonic set; edge-to-vertex m-detour monophonic basis; edge-to-vertex m-detour monophonic number.

Texto completo disponible sólo en PDF.

Full text available only in PDF format


[1] F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, CA, (1990). [ Links ]

[2] G. Chartrand , H. Escuadro , and P. Zhang , Detour Distance in Graphs, J. Combin. Math. Combin. Comput. 53, pp. 75-94, (2005). [ Links ]

[3] G. Chartrand, G. L. Johns , and P. Zhang , The Detour Number of a Graph, Utilitas Mathematica 64, pp. 97-113, (2003). [ Links ]

[4] G. Chartrand, G.L. Johns, and P. Zhang, On the Detour Number and Geodetic Number of a Graph, Ars Combinatoria 72, pp. 3-15, (2004). [ Links ]

[5] F. Harary, Graph Theory, Addison-Wesley, (1969). [ Links ]

[6] A. P. Santhakumaran and P. Titus , Monophonic distance in graphs, Discrete Mathematics, Algorithms and Applications, Vol. 3, No. 2, pp. 159-169, (2011). [ Links ]

[7] A. P. Santhakumaran and P. Titus, A Note on Monophonic Distance in Graphs, Discrete Mathematics, Algorithms and Applications , DOI: 10.1142/S1793830912500188, Vol.4, No. 2, (2012). [ Links ]

[8] A. P. Santhakumaran, P. Titus and K. Ganesamoorthy , Edge-toVertex Detour Monophonic Number of a Graph, Romanian Journal of Mathematics and Computer Science, Vol.4, No.1, pp. 180-188, (2014). [ Links ]

[9] P. Titus, K. Ganesamoorthy and P. Balakrishnan , The Detour Monophonic Number of a Graph, J. Combin. Math. Combin. Comput. 83, pp. 179-188, (2013). [ Links ]

[10] P. Titus and K. Ganesamoorthy, On the Detour Monophonic Number of a Graph, Ars Combinatoria, 129, pp. 33-42, (2016). [ Links ]

fn1* Research work supported by NBHM Project No. NBHM/R.P.29/2015/Fresh/157.

Received: April 2017; Accepted: April 2018

Creative Commons License This is an open-access article distributed under the terms of the Creative Commons Attribution License