dc.creator | Santhakumaran, A. P. | |
dc.date | 2021-07-26 | |
dc.date.accessioned | 2023-09-22T12:43:08Z | |
dc.date.available | 2023-09-22T12:43:08Z | |
dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4454 | |
dc.identifier | 10.22199/issn.0717-6279-4454 | |
dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/234438 | |
dc.description | 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. | en-US |
dc.format | application/pdf | |
dc.language | eng | |
dc.publisher | Universidad Católica del Norte. | en-US |
dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4454/3859 | |
dc.rights | Copyright (c) 2021 A. P. Santhakumaran | en-US |
dc.rights | http://creativecommons.org/licenses/by/4.0 | en-US |
dc.source | Proyecciones (Antofagasta, On line); Vol. 40 No. 4 (2021); 963-979 | en-US |
dc.source | Proyecciones. Revista de Matemática; Vol. 40 Núm. 4 (2021); 963-979 | es-ES |
dc.source | 0717-6279 | |
dc.source | 10.22199/issn.0717-6279-2021-04 | |
dc.subject | Detour | en-US |
dc.subject | Edge-to-vertex detour set | en-US |
dc.subject | Edge-to-vertex detour basis | en-US |
dc.subject | Edge-to- vertex detour number | en-US |
dc.subject | 05C12 | en-US |
dc.title | Graphs of edge-to-vertex detour number 2 | en-US |
dc.type | info:eu-repo/semantics/article | |
dc.type | info:eu-repo/semantics/publishedVersion | |
dc.type | text | en-US |