1294
правки
Arithmetic graph: различия между версиями
Материал из WEGA
нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''Arithmetic graph''' --- арифметичский граф. Let <math>m</math> be a power of a prime <math>p</math>, then the '''arithmetic graph''' <math>G_{…») |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Arithmetic graph''' | '''Arithmetic graph''' — ''[[арифметический граф]].'' | ||
Let <math>m</math> be a power | Let <math>m</math> be a power of a prime <math>p</math>, then the '''arithmetic graph''' <math>G_{m}</math> is defined to be a [[graph, undirected graph, nonoriented graph|graph]] | ||
of a prime <math>p</math>, then the '''arithmetic graph''' <math>G_{m}</math> is defined to be a graph | whose [[vertex]] set is the set of all divisors of <math>m</math> (excluding 1) and | ||
whose vertex set is the set of all divisors of <math>m</math> (excluding 1) and | |||
two distinct vertices <math>a</math> and <math>b</math> are adjacent if and only if | two distinct vertices <math>a</math> and <math>b</math> are adjacent if and only if | ||
<math>\gcd(a,b) = p^{i}</math>, where <math>i = 1 \pmod{2}</math>. | <math>\gcd(a,b) = p^{i}</math>, where <math>i = 1 \pmod{2}</math>. | ||
