Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Tiller, Charlotte"'
Publikováno v:
ETSU Faculty Works.
Let G = (V, E) be a nontrivial connected graph. For a subset S ⊆ V, the geodesic closure (S) of S is the set of all vertices on geodesics (shortest paths) between two vertices of S. We study the geodetic achievement and avoidance games defined by B
Externí odkaz:
https://dc.etsu.edu/etsu-works/14063
Publikováno v:
QM - Quaestiones Mathematicae; Dec2003, Vol. 26 Issue 4, p389-397, 9p