Graphs of edge-to-vertex detour number 2
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,...
Saved in:
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000400963 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|