Weakly geodetic graph: различия между версиями

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Weakly geodetic graph''' --- слабо геодезический граф. <math>G<\math> is a ''' weakly geodetic graph''' if for every pair of vertices whos…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Weakly geodetic graph''' --- слабо геодезический граф.  
'''Weakly geodetic graph''' --- слабо геодезический граф.  


<math>G<\math> is a ''' weakly geodetic graph''' if for every pair of vertices whose distance is
<math>G</math> is a ''' weakly geodetic graph''' if for every pair of vertices whose distance is
at most 2 there is a unique path of the minimum length between them.
at most 2 there is a unique path of the minimum length between them.

Текущая версия от 14:42, 30 августа 2011

Weakly geodetic graph --- слабо геодезический граф.

[math]\displaystyle{ G }[/math] is a weakly geodetic graph if for every pair of vertices whose distance is at most 2 there is a unique path of the minimum length between them.