Arithmetic graph

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

Arithmetic graphарифметический граф.

Let m be a power of a prime p, then the arithmetic graph G_{m} is defined to be a graph whose vertex set is the set of all divisors of m (excluding 1) and two distinct vertices a and b are adjacent if and only if \gcd(a,b) = p^{i}, where i = 1  \pmod{2}.