end-vertex

end-vertex

[′end ‚vər‚teks]
(mathematics)
A vertex of a graph that has exactly one edge incident to it.
References in periodicals archive ?
If max{d(x),d(y)}[greater than or equal to]c/2 for any two vertices u and v with d(u,v)=2, then G has a longest path with at least an end-vertex x satisfying d(x)[greater than or equal to]c/2 or G is a Hamiltonian.
1])[greater than or equal to]c/2, then Pm is the longest path of G of order m with its end-vertex [x.