SciELO - Scientific Electronic Library Online

 
vol.40 issue4Basarab loop and the generators of its total multiplication groupλ-quasi Cauchy sequence of fuzzy numbers author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

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

Share


Proyecciones (Antofagasta)

Print version ISSN 0716-0917

Proyecciones (Antofagasta) vol.40 no.4 Antofagasta  2021

http://dx.doi.org/10.22199/issn.0717-6279-4454 

Artículos

Graphs of edge-to-vertex detour number 2

1Hindustan Institute of Technology and Science, Dept. of Mathematics, Chennai, TN, India. E-mail: apskumar1953@gmail.com

Abstract

For two vertices u and v in a graph G = (V,E), the detour distance D(u, v) is the length of a longest u − v path in G. A u − v path of length D(u, v) is called a u−v detour. For subsets A and B of V, the detour distance D(A, B) is defined as D(A, B) = min{D(x, y) : x ∈ A, y ∈ B}. A u − v path of length D(A, B) is called an A-B detour joining the sets A, B ⊆ V where u ∈ A and v ∈ B. A vertex x is said to lie on an A − B detour if x is a vertex of some A − B detour. A set S ⊆ E is called an edge-to-vertex detour set if every vertex of G is incident with an edge of S or lies on a detour joining a pair of edges of S. The edge-to-vertex detour number dn 2 (G) of G is the minimum order of its edge-to-vertex detour sets and any edge-to-vertex detour set of order dn 2 (G) is an edge-to-vertex detour basis of G. Graphs G of size q for which dn 2 (G)=2 are characterized.

Keywords: Detour; Edge-to-vertex detour set; Edge-to-vertex detour basis; Edge-to-vertex detour number

Texto completo disponible sólo en PDF

Full text available only in PDF format.

References

[1] F. Buckley and F. Harary, Distance in graph, Reading, MA: Addison-Wesley, 1990. [ Links ]

[2] G. Chartrand, H. Escuadro, and P. Zhang, “Detour distance in graphs”, Journal of combinatorial mathematics and combinatorial computing, vol. 53, pp. 75-94, 2005. [ Links ]

[3] G. Chartrand , G. L. Johns, and P. Zhang, “The detour number of a graph”, Utilitas mathematica, vol. 64, pp. 97-113, 2003. [ Links ]

[4] G. Chartrand , P. Zang, and T. W. Haynes, “Distance in Graphs-Taking the Long View”, AKCE international journal of graphs and combinatorics, vol. 1, no. 1, pp. 1-13, 2004. Doi: 10.1080/09728600.2004.12088775 [ Links ]

[5] G. Chartrand andP. Zang , Introduction to graph theory. New Delhi: Tata McGraw-Hill, 2006. [ Links ]

[6] A. P. Santhakumaran and S. Athisayanathan, “The edge-to-vertex detour number of a graph”, Advanced studies in contemporary mathematics, vol. 21, no. 4, pp. 395-412, 2011. [ Links ]

[7] A. P. Santhakumaran , “On the edge-to-vertex detour number of a graph”, Advanced studies in contemporary mathematics , vol. 24, no. 3, pp. 405-420, 2014. [ Links ]

Received: September 10, 2020; Accepted: January 08, 2021

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