Honest graph: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Honest graph''' --- честный граф. A graph <math>G</math> is called '''honest''' if its ''edge-integrity'' is the maximum possible; that is, equal to …») |
(нет различий)
|
Текущая версия от 16:34, 17 мая 2011
Honest graph --- честный граф.
A graph [math]\displaystyle{ G }[/math] is called honest if its edge-integrity is the maximum possible; that is, equal to the order of the graph. It is known that every graph of diameter 2 is honest. It is easy to see that only 3-, 4-, and 5-cycles are honest 2-regular graphs.