Codiameter

Материал из WikiGrapp
Перейти к:навигация, поиск

Codiameterкодиаметр.

Let \,u,v \in V(G) be any two distinct vertices. We denote by \,p(u,v) the length of the longest path connecting \,u and \,v. The codiameter of \,G, denoted by \,d^{\ast}, is defined to be \min\{p(u,v) | \; u,v \in V(G)\}. A graph \,G of order \,n is said to be Hamilton-connected if d^{\ast}(G) = n-1, i.e. every two distinct vertices are joined by a Hamiltonian path

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.