Graphs of edge-to-vertex detour number 2
DOI:
https://doi.org/10.22199/issn.0717-6279-4454Keywords:
Detour, Edge-to-vertex detour set, Edge-to-vertex detour basis, Edge-to- vertex detour numberAbstract
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 dn2(G) of G is the minimum order of its edge-to-vertex detour sets and any edge-to-vertex detour set of order dn2(G) is an edge-to-vertex detour basis of G. Graphs G of size q for which dn2(G) = 2 are characterized.
References
F. Buckley and F. Harary, Distance in graph, Reading, MA: Addison-Wesley, 1990.
G. Chartrand, H. Escuadro, and P. Zhang, “Detour distance in graphs”, Journal of combinatorial mathematics and combinatorial computing, vol. 53, pp. 75-94, 2005.
G. Chartrand, G. L. Johns, and P. Zhang, “The detour number of a graph”, Utilitas mathematica, vol. 64, pp. 97-113, 2003.
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. https://doi.org/10.1080/09728600.2004.12088775
G. Chartrand and P. Zang, Introduction to graph theory. New Delhi: Tata McGraw-Hill, 2006.
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.
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.
Published
How to Cite
Issue
Section
Copyright (c) 2021 A. P. Santhakumaran
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.